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 条
  • [21] Reoptimization of the minimum spanning tree
    Paschos, Stratos A.
    Paschos, Vangelis Th.
    WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2012, 4 (02): : 211 - 217
  • [22] Contractors' minimum spanning tree
    Hartman, Irith Ben-Arroyo
    Newman, Ilan
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2019, 74 : 33 - 45
  • [23] Enhancement of Minimum Spanning Tree
    Patel, Nimesh
    Patel, K. M.
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ICT FOR SUSTAINABLE DEVELOPMENT, ICT4SD 2015, VOL 1, 2016, 408 : 89 - 95
  • [24] UPDATING A MINIMUM SPANNING TREE
    ROGER, JH
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES C-APPLIED STATISTICS, 1971, 20 (02) : 204 - &
  • [25] Drawing a tree as a minimum spanning tree approximation
    Di Giacomo, Emilio
    Didimo, Walter
    Liotta, Giuseppe
    Meijer, Henk
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2012, 78 (02) : 491 - 503
  • [26] Drawing a Tree as a Minimum Spanning Tree Approximation
    Di Giacomo, Emilio
    Didimo, Walter
    Liotta, Giuseppe
    Meijer, Henk
    ALGORITHMS AND COMPUTATION, PT 2, 2010, 6507 : 61 - +
  • [27] ON THE HISTORY OF THE MINIMUM SPANNING TREE PROBLEM
    GRAHAM, RL
    HELL, P
    ANNALS OF THE HISTORY OF COMPUTING, 1985, 7 (01): : 43 - 57
  • [28] ON THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
    MYUNG, YS
    LEE, CH
    TCHA, DW
    NETWORKS, 1995, 26 (04) : 231 - 241
  • [29] An optimal minimum spanning tree algorithm
    Pettie, S
    Ramachandran, V
    JOURNAL OF THE ACM, 2002, 49 (01) : 16 - 34
  • [30] The stackelberg minimum spanning tree game
    Cardinal, Jean
    Demaine, Erik D.
    Fiorini, Samuel
    Joret, Gwenaeal
    Langerman, Stefan
    Newman, Ilan
    Weimann, Oren
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 64 - +
12345