A note on the minimum label spanning tree

被引：39
|
作者：
Wan, YY [1 ]
Chen, GL [1 ]
Xu, YL [1 ]
机构：
[1] Univ Sci & Technol China, Dept Comp Sci & Technol, Natl High Performance Comp Ctr, Hefei 230027, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 2002年 / 84卷 / 02期
关键词：
network design; NP-hard; approximation algorithms; spanning tree;
D O I：
10.1016/S0020-0190(02)00230-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We give a tight analysis of the greedy algorithm introduced by Krumke and Wirth for the minimum label spanning tree problem. The algorithm is shown to be a (In(n - 1) + 1)-approximation for any graph with n nodes (n > 1), which improves the known performance guarantee 2 In n + 1. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：99 / 101
页数：3
相关论文
共 50 条
  • [41] THE PROBABILISTIC MINIMUM SPANNING TREE PROBLEM
    BERTSIMAS, DJ
    NETWORKS, 1990, 20 (03) : 245 - 275
  • [42] The Stackelberg Minimum Spanning Tree Game
    Jean Cardinal
    Erik D. Demaine
    Samuel Fiorini
    Gwenaël Joret
    Stefan Langerman
    Ilan Newman
    Oren Weimann
    Algorithmica, 2011, 59 : 129 - 144
  • [43] THE QUADRATIC MINIMUM SPANNING TREE PROBLEM
    ASSAD, A
    XU, WX
    NAVAL RESEARCH LOGISTICS, 1992, 39 (03) : 399 - 417
  • [44] Minimum spanning tree pose estimation
    Steele, Kevin L.
    Egbert, Parris K.
    THIRD INTERNATIONAL SYMPOSIUM ON 3D DATA PROCESSING, VISUALIZATION, AND TRANSMISSION, PROCEEDINGS, 2007, : 440 - 447
  • [45] The minimum spanning tree problem in archaeology
    Hage, P
    Harary, F
    James, B
    AMERICAN ANTIQUITY, 1996, 61 (01) : 149 - 155
  • [46] ON THE MINIMUM DIAMETER SPANNING TREE PROBLEM
    HASSIN, R
    TAMIR, A
    INFORMATION PROCESSING LETTERS, 1995, 53 (02) : 109 - 111
  • [47] A FAST ALGORITHM FOR THE MINIMUM SPANNING TREE
    SURAWEERA, F
    COMPUTERS IN INDUSTRY, 1989, 13 (02) : 181 - 185
  • [48] On the Length of a Random Minimum Spanning Tree
    Cooper, Colin
    Frieze, Alan
    Ince, Nate
    Janson, Svante
    Spencer, Joel
    COMBINATORICS PROBABILITY & COMPUTING, 2016, 25 (01): : 89 - 107
  • [49] Generalized minimum spanning tree games
    Phuoc Hoang Le
    Tri-Dung Nguyen
    Bektas, Tolga
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2016, 4 (02) : 167 - 188
  • [50] An Efficient Minimum Spanning Tree Algorithm
    Abdullah-Al Mamun
    Rajasekaran, Sanguthevar
    2016 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATION (ISCC), 2016, : 1047 - 1052
12345