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 条
  • [31] The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking
    Chawachat, Jakarin
    Fakcharoenphol, Jittat
    Jindaluang, Wattana
    INFORMATION PROCESSING LETTERS, 2012, 112 (24) : 937 - 941
  • [32] Approximating the directed minimum degree spanning tree of directed acyclic graph
    Yao, Guohui
    Zhu, Daming
    Ma, Shaohan
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2009, 46 (06): : 1052 - 1057
  • [33] Diameter Constrained Fuzzy Minimum Spanning Tree Problem
    Abu Nayeem, Sk. Md.
    Pal, Madhumangal
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2013, 6 (06) : 1040 - 1051
  • [34] Diameter Constrained Fuzzy Minimum Spanning Tree Problem
    Sk. Md. Abu Nayeem
    Madhumangal Pal
    International Journal of Computational Intelligence Systems, 2013, 6 : 1040 - 1051
  • [35] Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
    Gruber, Martin
    van Hemert, Jano
    Raidl, Guenther R.
    GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2006, : 1187 - +
  • [36] Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem
    Kavita Singh
    Shyam Sundar
    Soft Computing, 2021, 25 : 11289 - 11305
  • [37] Approximating Bounded Degree Maximum Spanning Subgraphs
    Feng, Wangsen
    Ma, Hao
    Zhang, Bei
    Wang, Hanpin
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 83 - +
  • [38] Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem
    Singh, Kavita
    Sundar, Shyam
    SOFT COMPUTING, 2021, 25 (16) : 11289 - 11305
  • [39] A probabilistic analysis of an approximation algorithm for the minimum weight spanning tree problem with bounded from below diameter
    Gimadi, EK
    Serdyukov, AI
    OPERATIONS RESEARCH PROCEEDINGS 1999, 2000, : 63 - 68
  • [40] A hybrid heuristic for the diameter constrained minimum spanning tree problem
    Abilio Lucena
    Celso C. Ribeiro
    Andréa C. Santos
    Journal of Global Optimization, 2010, 46 : 363 - 381
12345