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 条
  • [21] On Approximating Degree-Bounded Network Design Problems
    Xiangyu Guo
    Guy Kortsarz
    Bundit Laekhanukit
    Shi Li
    Daniel Vaz
    Jiayi Xian
    Algorithmica, 2022, 84 : 1252 - 1278
  • [22] A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
    Raidl, Guenther R.
    Gruber, Martin
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, 2008, 1048 : 446 - 449
  • [23] Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem
    Patvardhan, C.
    Prakash, V. Prem
    Srivastav, A.
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2015, 39 (03): : 281 - 292
  • [24] A New Hybrid Genetic Algorithm for Solving the Bounded Diameter Minimum Spanning Tree Problem
    Huynh Thi Thanh Binh
    Nguyen Xuan, Hoai
    McKay, R. I.
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 3128 - +
  • [25] A learning automata based approach to the bounded-diameter minimum spanning tree problem
    Torkestani, Javad Akbari
    Rezaei, Zahra
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2013, 36 (06) : 749 - 759
  • [26] Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
    Singh, Mohit
    Lau, Lap Chi
    JOURNAL OF THE ACM, 2015, 62 (01) : 1
  • [27] Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
    Singh, Mohit
    Lau, Lap Chi
    STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 661 - 670
  • [28] Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
    Seo, Dae Young
    Lee, D. T.
    Lin, Tien-Ching
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 283 - +
  • [29] Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem
    Bernath, Attila
    Ciebiera, Krzysztof
    Godlewski, Piotr
    Sankowski, Piotr
    EXPERIMENTAL ALGORITHMS, SEA 2014, 2014, 8504 : 74 - 86
  • [30] Finding bounded diameter minimum spanning tree in general graphs
    Segal, Michael
    Tzfaty, Oren
    COMPUTERS & OPERATIONS RESEARCH, 2022, 144
12345