Approximating degree-bounded minimum spanning trees of directed acyclic graphs

被引：0
|
作者：
Li, Hengwu [1 ]
Liu, Zhendong [2 ]
Han, Huijian [1 ]
机构：
[1] Department of Computer Science and Technology, Shandong Economic University, Jinan 250014, China
[2] Department of Computer Science and Technology, Shandong Architecture University, Jinan 250101, China
来源：
Journal of Computational Information Systems | 2010年 / 6卷 / 07期
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Approximation algorithms
引用
收藏
页码：2399 / 2406
相关论文
共 50 条
  • [1] Degree-bounded minimum spanning trees
    Jothi, Raja
    Raghavachari, Balaji
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) : 960 - 970
  • [2] Approximating the degree-bounded minimum diameter spanning tree problem
    Könemann, J
    Levin, A
    Sinha, A
    ALGORITHMICA, 2005, 41 (02) : 117 - 129
  • [3] 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
  • [4] Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
    Jochen Könemann
    Asaf Levin
    Amitabh Sinha
    Algorithmica , 2005, 41 : 117 - 129
  • [5] 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
  • [6] 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
  • [7] Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
    Singh, Mohit
    Lau, Lap Chi
    JOURNAL OF THE ACM, 2015, 62 (01) : 1
  • [8] 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
  • [9] A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
    Yao, Guohui
    Zhu, Daming
    Li, Hengwu
    Ma, Shaohan
    DISCRETE MATHEMATICS, 2008, 308 (17) : 3951 - 3959
  • [10] Minimum bounded degree spanning trees
    Goemans, Michel X.
    47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 273 - 282
12345