IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2011-09-06 13:45
Experimental Evaluation of Algorithm for Minimum-Weight Rooted Not-Necessarily-Spanning Arborescence Problem
Yusuke Abe, Eishi Chiba (Hosei Univ.) COMP2011-24
Abstract (in Japanese) (See Japanese page) 
(in English) We study a problem that finds a minimum-weight rooted not-necessarily-spanning arborescence
in a connected acyclic digraph with real weights on arcs.
The problem was first proposed by V. V. Rao and R. Sridharan,
``Minimum-weight rooted not-necessarily-spanning arborescence problem,''
Networks, vol. 39(2), pp. 77--87 (2002)
in which they showed that the problem is NP-hard,
and presented a Lagrangian heuristic to solve it.
In this paper, we implement their heuristic and evaluate the performance by computational experimentation.
Keyword (in Japanese) (See Japanese page) 
(in English) Arborescence / Lagrangian relaxation / Heuristic algorithm / Combinatorial optimization / / / /  
Reference Info. IEICE Tech. Rep., vol. 111, no. 195, COMP2011-24, pp. 39-45, Sept. 2011.
Paper # COMP2011-24 
Date of Issue 2011-08-30 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2011-24

Conference Information
Committee COMP IPSJ-AL  
Conference Date 2011-09-06 - 2011-09-06 
Place (in Japanese) (See Japanese page) 
Place (in English) Hakodate City Central Library 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2011-09-COMP-AL 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Experimental Evaluation of Algorithm for Minimum-Weight Rooted Not-Necessarily-Spanning Arborescence Problem 
Sub Title (in English)  
Keyword(1) Arborescence  
Keyword(2) Lagrangian relaxation  
Keyword(3) Heuristic algorithm  
Keyword(4) Combinatorial optimization  
1st Author's Name Yusuke Abe  
1st Author's Affiliation Hosei University (Hosei Univ.)
2nd Author's Name Eishi Chiba  
2nd Author's Affiliation Hosei University (Hosei Univ.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2011-09-06 13:45:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2011-24 
Volume (vol) vol.111 
Number (no) no.195 
Page pp.39-45 
Date of Issue 2011-08-30 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan