JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/9861

Title: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Authors: Okamoto, Yoshio
Otachi, Yota
Uehara, Ryuhei
Uno, Takeaki
Keywords: Spanning tree congestion
chain graph
split graph
computational complexity
Issue Date: 2011-04-27
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 6648/2011
Start page: 452
End page: 462
DOI: 10.1007/978-3-642-20877-5_44
Abstract: Spanning tree congestion is a relatively new graph parameter, whichhas been studied intensively. This paper studies the complexity of the problemto determine the spanning tree congestion for non-sparse graph classes, while itwas investigated for some sparse graph classes before. We prove that the problemis NP-hard even for chain graphs and split graphs. To cope with the hardnessof the problem, we present a fast (exponential-time) exact algorithm that runs inO ^∗(2^n) time, where n denotes the number of vertices. Additionally, we providea constant-factor approximation algorithm for cographs, and a linear-time algorithmfor chordal cographs.
Rights: This is the author-created version of Springer, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara and Takeaki Uno, Lecture Notes in Computer Science, 6648/2011, 2011, 452-462. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-20877-5_44
URI: http://hdl.handle.net/10119/9861
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
16956-1.pdf67KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology