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 2010-01-25 10:05
Complexity results for the spanning tree congestion problem
Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) COMP2009-40
Abstract (in Japanese) (See Japanese page) 
(in English) We study the computational complexity of determining the \emph{spanning tree congestion} of a graph. First, we show that the problem of determining whether a given graph has spanning tree congestion at most fixed $k$ can be solved in linear time for graphs of bounded degree. Next, we show that the problem becomes NP-complete for every fixed $k \ge 10$ if we allow only one vertex of unbounded degree in the input graphs. We also show that it is NP-hard to approximate the spanning tree congestion of such graphs within a factor better than $11/10$.
Keyword (in Japanese) (See Japanese page) 
(in English) Spanning tree congestion / Fixed parameter tractability / NP-hardness / / / / /  
Reference Info. IEICE Tech. Rep., vol. 109, no. 391, COMP2009-40, pp. 9-16, Jan. 2010.
Paper # COMP2009-40 
Date of Issue 2010-01-18 (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 COMP2009-40

Conference Information
Committee COMP  
Conference Date 2010-01-25 - 2010-01-25 
Place (in Japanese) (See Japanese page) 
Place (in English) Nishijin Plaza, Kyushu University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2010-01-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Complexity results for the spanning tree congestion problem 
Sub Title (in English)  
Keyword(1) Spanning tree congestion  
Keyword(2) Fixed parameter tractability  
Keyword(3) NP-hardness  
1st Author's Name Yota Otachi  
1st Author's Affiliation Gunma University (Gunma Univ.)
2nd Author's Name Hans L. Bodlaender  
2nd Author's Affiliation Utrecht University (Utrecht 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 ()
Date Time 2010-01-25 10:05:00 
Presentation Time 35 
Registration for COMP 
Paper # IEICE-COMP2009-40 
Volume (vol) IEICE-109 
Number (no) no.391 
Page pp.9-16 
#Pages IEICE-8 
Date of Issue IEICE-COMP-2010-01-18 

[Return to Top Page]

[Return to IEICE Web Page]

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