An O(log k)-approximation algorithm for the k minimum spanning tree problem in the plane

被引：15
|
作者：
Garg, N [1 ]
Hochbaum, DS [1 ]
机构：
[1] UNIV CALIF BERKELEY,BERKELEY,CA 94720
来源：
ALGORITHMICA | 1997年 / 18卷 / 01期
关键词：
grids; traveling salesman problem;
D O I：
10.1007/BF02523691
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Given n points in the Euclidean plane, we consider the problem of finding the minimum tree spanning any k points. The problem is NP-hard and we give an O (log k)-approximation algorithm.
引用
收藏
页码：111 / 121
页数：11
相关论文
共 50 条
  • [1] An O(log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane
    Garg, N.
    Hochbaum, D.S.
    [J]. Algorithmica (New York), 1997, 18 (01): : 111 - 121
  • [2] AN O(log2 k)-APPROXIMATION ALGORITHM FOR THE k-VERTEX CONNECTED SPANNING SUBGRAPH PROBLEM
    Fakcharoenphol, Jittat
    Laekhanukit, Bundit
    [J]. SIAM JOURNAL ON COMPUTING, 2012, 41 (05) : 1095 - 1109
  • [3] An O(log2 k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem
    Fakcharoenphol, Jittat
    Laekhanukit, Bundit
    [J]. STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 153 - 158
  • [4] AnO(logk)-approximation algorithm for thek minimum spanning tree problem in the plane
    N. Garg
    D. S. Hochbaum
    [J]. Algorithmica, 1997, 18 : 111 - 121
  • [5] AN O(LOG-M) PARALLEL ALGORITHM FOR THE MINIMUM SPANNING TREE PROBLEM
    SURAWEERA, F
    BHATTACHARYA, P
    [J]. INFORMATION PROCESSING LETTERS, 1993, 45 (03) : 159 - 163
  • [6] Heuristics for Minimum Spanning k-tree Problem
    Shangin, Roman E.
    Pardalos, Panos M.
    [J]. 2ND INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT, ITQM 2014, 2014, 31 : 1074 - 1083
  • [7] An approximation algorithm for the balanced capacitated minimum spanning tree problem
    Fallah, Haniyeh
    Didehvar, Farzad
    Rahmati, Farhad
    [J]. Scientia Iranica, 2021, 28 (3 D) : 1479 - 1492
  • [8] An approximation algorithm for the balanced capacitated minimum spanning tree problem
    Fallah, H.
    Didehvar, F.
    Rahmati, F.
    [J]. SCIENTIA IRANICA, 2021, 28 (03) : 1479 - 1492
  • [9] A 3-approximation for the minimum tree spanning k vertices
    Garg, N
    [J]. 37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 302 - 309
  • [10] A note on the k-minimum spanning tree problem on circles
    Knecht, Thomas
    Jungnickel, Dieter
    [J]. OPERATIONS RESEARCH LETTERS, 2016, 44 (02) : 199 - 201
12345