Approximating maximum leaf spanning trees in almost linear time

被引：71
|
作者：
Lu, HI [1 ]
Ravi, R
机构：
[1] Natl Chung Cheng Univ, Dept CSIE, Tainan, Taiwan
[2] Carnegie Mellon Univ, Grad Sch Ind Adm, Pittsburgh, PA 15213 USA
来源：
JOURNAL OF ALGORITHMS | 1998年 / 29卷 / 01期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1006/jagm.1998.0944
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Given an undirected graph, Ending a spanning tree of the graph with the maximum number of leaves is MAX SNP-complete. In this paper we give a new greedy 3-approximation algorithm for maximum leaf spanning trees. The running time O((m + n)alpha(m, n)) required by our algorithm: where nt is the number of edges and n is the number of nodes, is almost linear in the size of the graph. We also demonstrate that our analysis of the performance of the greedy algorithm is tight via an example, (C) 1998 Academic Press.
引用
下载
收藏
页码：132 / 141
页数：10
相关论文
共 50 条
  • [1] Distance approximating spanning trees
    Prisner, E
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 499 - 510
  • [2] Approximating Maximum Matching Requires Almost Quadratic Time
    Behnezhad, Soheil
    Roghani, Mohammad
    Rubinstein, Aviad
    Proceedings of the Annual ACM Symposium on Theory of Computing, : 444 - 454
  • [3] Approximating Maximum Matching Requires Almost Quadratic Time
    Behnezhad, Soheil
    Roghani, Mohammad
    Rubinstein, Aviad
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 444 - 454
  • [4] Approximating Spanning Trees with Few Branches
    Chimani, Markus
    Spoerhase, Joachim
    THEORY OF COMPUTING SYSTEMS, 2015, 56 (01) : 181 - 196
  • [5] Approximating Spanning Trees with Few Branches
    Markus Chimani
    Joachim Spoerhase
    Theory of Computing Systems, 2015, 56 : 181 - 196
  • [6] Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces
    Chang, Ching-Lueh
    Chang, Chun-Wei
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024, 35 (05) : 595 - 603
  • [7] Approximating spanning trees with inner nodes cost
    Fleischer, R
    Ge, Q
    Li, J
    Tian, SJ
    Wang, HT
    PDCAT 2005: SIXTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2005, : 660 - 664
  • [8] Approximating Small Balanced Vertex Separators in Almost Linear Time
    Sebastian Brandt
    Roger Wattenhofer
    Algorithmica, 2019, 81 : 4070 - 4097
  • [9] Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
    Darties, Benoit
    Gastineau, Nicolas
    Togni, Olivier
    DISCRETE APPLIED MATHEMATICS, 2018, 236 : 124 - 136
  • [10] Approximating Bounded Degree Maximum Spanning Subgraphs
    Feng, Wangsen
    Ma, Hao
    Zhang, Bei
    Wang, Hanpin
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 83 - +
12345