Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

被引：0

作者：

Jochen Könemann

Asaf Levin

Amitabh Sinha

机构：

[1] Department of Combinatorics and Optimization,

[2] University of Waterloo,undefined

[3] 200 University Avenue West,undefined

[4] Waterloo,undefined

[5] Ontario,undefined

[6] N2L 3G1,undefined

[7] Faculty of Industrial Engineering and Management,undefined

[8] The Technion,undefined

[9] Haifa 32000,undefined

[10] Business School,undefined

[11] University of Michigan,undefined

[12] Ann Arbor,undefined

[13] MI 48103,undefined

来源：

Algorithmica | 2005年 / 41卷

关键词：

Approximation algorithms; Spanning trees; Bicriteria approximation; Degree-bounded spanning trees;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We consider the problem of finding a minimum diameter spanning tree with maximum node degree $B$ in a complete undirected edge-weighted graph. We provide an $O(\sqrt{\log_Bn})$-approximation algorithm for the problem. Our algorithm is purely combinatorial, and relies on a combination of filtering and divide and conquer.

引用

页码：117 / 129

页数：12

共 50 条

[1] Approximating the degree-bounded minimum diameter spanning tree problem
Könemann, J
Levin, A
Sinha, A
ALGORITHMICA, 2005, 41 (02) : 117 - 129
[2] Approximating the degree-bounded minimum diameter spanning tree problem
Könemann, J
Levin, A
Sinha, A
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION, 2003, 2764 : 109 - 121
[3] Approximating degree-bounded minimum spanning trees of directed acyclic graphs
Li, Hengwu
Liu, Zhendong
Han, Huijian
Journal of Computational Information Systems, 2010, 6 (07): : 2399 - 2406
[4] Degree-bounded minimum spanning tree for unit disk graph
Xu, Hongli
Huang, Liusheng
Liu, Wang
Zhang, Yindong
Sun, Yanjing
THEORETICAL COMPUTER SCIENCE, 2012, 418 : 92 - 105
[5] Degree-bounded minimum spanning trees
Jothi, Raja
Raghavachari, Balaji
DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) : 960 - 970
[6] A Heuristic for the Bounded Diameter Minimum Spanning Tree Problem
Singh, Kavita
Sundar, Shyam
ISMSI 2018: PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, METAHEURISTICS & SWARM INTELLIGENCE, 2018, : 84 - 88
[7] Stochastic Bounded Diameter Minimum Spanning Tree Problem
Torkestani, Javad Akbari
FUNDAMENTA INFORMATICAE, 2015, 140 (02) : 205 - 219
[8] Parallel Heuristics for the Bounded Diameter Minimum Spanning Tree Problem
Patvardhan, C.
Prakash, V. Prem
Srivastav, A.
2014 Annual IEEE India Conference (INDICON), 2014,
[9] Probabilistic analysis of the degree bounded minimum spanning tree problem
Srivastav, Anand
Werth, Soeren
FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 497 - 507
[10] A matter of degree:: Improved approximation algorithms for degree-bounded minimum spanning trees
Könemann, J
Ravi, R
SIAM JOURNAL ON COMPUTING, 2002, 31 (06) : 1783 - 1793

← 1 2 3 4 5 →