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 条
  • [1] On the minimum label spanning tree problem
    Krumke, SO
    Wirth, HC
    INFORMATION PROCESSING LETTERS, 1998, 66 (02) : 81 - 85
  • [2] Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
    Naji-Azimi, Zahra
    Salari, Majid
    Golden, Bruce
    Raghavan, S.
    Toth, Paolo
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (11) : 1952 - 1964
  • [3] Minimum Spanning Tree Problem with Label Selection
    Fujiyoshi, Akio
    Suzuki, Masakazu
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (02) : 233 - 239
  • [4] Improved heuristics for the minimum label spanning tree problem
    Xiong, Yapei
    Golden, Bruce
    Wasil, Edward
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) : 700 - 703
  • [5] The label-constrained minimum spanning tree problem
    Xiong, Yupei
    Golden, Bruce
    Wasil, Edward
    Chen, Si
    TELECOMMUNICATIONS MODELING, POLICY, AND TECHNOLOGY, 2008, : 39 - +
  • [6] Heuristics for the strong generalized minimum label spanning tree problem
    Cerrone, Carmine
    D'Ambrosio, Ciriaco
    Raiconi, Andrea
    NETWORKS, 2019, 74 (02) : 148 - 160
  • [7] Performance of a simple ACO on the minimum label spanning tree problem
    Xinsheng Lai
    Yuhang Cen
    Discover Applied Sciences, 7 (5)
  • [8] Musical Note Recognition Using Minimum Spanning Tree Algorithm
    Sazaki, Yoppy
    Ayuni, Rosda
    Kom, S.
    2014 8TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATION SYSTEMS SERVICES AND APPLICATIONS (TSSA), 2014,
  • [9] A note on the k-minimum spanning tree problem on circles
    Knecht, Thomas
    Jungnickel, Dieter
    OPERATIONS RESEARCH LETTERS, 2016, 44 (02) : 199 - 201
  • [10] MINIMUM SPANNING TREE
    ROSS, GJS
    THE ROYAL STATISTICAL SOCIETY SERIES C-APPLIED STATISTICS, 1969, 18 (01): : 103 - &
12345