Approximating the degree-bounded minimum diameter spanning tree problem

被引：17
|
作者：
Könemann, J
Levin, A
Sinha, A
机构：
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[2] Technion Israel Inst Technol, Fac Ind Engn & Management, IL-32000 Haifa, Israel
[3] Univ Michigan, Sch Business, Ann Arbor, MI 48103 USA
[4] Carnegie Mellon Univ, Tepper Sch Business, Pittsburgh, PA 15213 USA
来源：
ALGORITHMICA | 2005年 / 41卷 / 02期
关键词：
approximation algorithms; spanning trees; bicriteria approximation; degree-bounded spanning trees;
D O I：
10.1007/s00453-004-1121-2
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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(rootlog(B) n)-approximation algorithm for the problem. Our algorithm is purely combinatorial. and relies on a combination of filtering and divide and conquer.
引用
收藏
页码：117 / 129
页数：13
相关论文
共 50 条
  • [1] Approximating the degree-bounded minimum diameter spanning tree problem
    Könemann, J
    Levin, A
    Sinha, A
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION, 2003, 2764 : 109 - 121
  • [2] Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
    Jochen Könemann
    Asaf Levin
    Amitabh Sinha
    [J]. Algorithmica , 2005, 41 : 117 - 129
  • [3] Approximating degree-bounded minimum spanning trees of directed acyclic graphs
    Li, Hengwu
    Liu, Zhendong
    Han, Huijian
    [J]. 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
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 418 : 92 - 105
  • [5] Degree-bounded minimum spanning trees
    Jothi, Raja
    Raghavachari, Balaji
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) : 960 - 970
  • [6] A Heuristic for the Bounded Diameter Minimum Spanning Tree Problem
    Singh, Kavita
    Sundar, Shyam
    [J]. 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
    [J]. 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.
    [J]. 2014 Annual IEEE India Conference (INDICON), 2014,
  • [9] Probabilistic analysis of the degree bounded minimum spanning tree problem
    Srivastav, Anand
    Werth, Soeren
    [J]. 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
    [J]. SIAM JOURNAL ON COMPUTING, 2002, 31 (06) : 1783 - 1793
12345