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 条
  • [21] Maximum Spanning Trees in Normed Planes
    Alonso, Javier
    Martin, Pedro
    GRAPHS AND COMBINATORICS, 2021, 37 (04) : 1385 - 1403
  • [22] Optimal layout of hexagonal minimum spanning trees in linear time
    Lin, GH
    Xue, GL
    ISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL IV: EMERGING TECHNOLOGIES FOR THE 21ST CENTURY, 2000, : 633 - 636
  • [23] Maximizing spanning trees in almost complete graphs
    Gilbert, B
    Myrvold, W
    NETWORKS, 1997, 30 (02) : 97 - 104
  • [24] Spanning trees with constraints on the leaf degree
    Kaneko, A
    DISCRETE APPLIED MATHEMATICS, 2001, 115 (1-3) : 73 - 76
  • [25] Approximating the Maximum Agreement Forest on k trees
    Chataigner, F
    INFORMATION PROCESSING LETTERS, 2005, 93 (05) : 239 - 244
  • [26] Maximum-Leaf Spanning Trees for Efficient Multi-Robot Recovery with Connectivity Guarantees
    Habibi, Golnaz
    McLurkin, James
    DISTRIBUTED AUTONOMOUS ROBOTIC SYSTEMS, 2014, 104 : 275 - 289
  • [27] Approximating k-hop minimum-spanning trees
    Althaus, E
    Funke, S
    Har-Peled, S
    Könemann, J
    Ramos, EA
    Skutella, M
    OPERATIONS RESEARCH LETTERS, 2005, 33 (02) : 115 - 120
  • [28] Counting spanning trees in almost complete multipartite graphs
    Sujing Cheng
    Wuxian Chen
    Weigen Yan
    Journal of Algebraic Combinatorics, 2022, 56 : 773 - 783
  • [29] Computing maximum-scoring segments in almost linear time
    Bengtsson, Fredrik
    Chen, Jingsen
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 255 - 264
  • [30] Randomized linear-time algorithm to find minimum spanning trees
    Stanford Univ, Stanford, United States
    J Assoc Comput Mach, 2 (321-328):
12345