Approximation algorithm for the maximum leaf spanning tree problem for cubic graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 686-698

  Loryś, Krzysztof ^a   Zwoźniak, Grażyna ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS;

ACCOUNTING METHODS; APPROXIMATION RATIOS; CUBIC GRAPH; LINEAR-TIME ALGORITHMS; MAXIMUM LEAF; SPANNING TREE; SPANNING TREE PROBLEMS;

TREES (MATHEMATICS);

EID: 33745651790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_60     Document Type: Conference Paper

References (17)

1. P. Alimonti, V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, 237, pages 123–134, 2000. 687
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy. Proof verification and the hardness of approximation problems, Proceedings of the Thirty-third Annual IEEE Symposium on Foundations of Computer Science, pages 14–23, 1992. 686
3. S. Arora, S. Safra Probabilistic checking of proofs: A new characterization of NP, Proceedings of the Thirty-third Annual IEEE Symposium on Foundations of Computer Science, pages 2–13, 1992. 686
4. E. W. Dijkstra Self-stabilizing systems in spite of distributed control, Communications of ACM 17, pages 643–644, 1974.
5. W. Duckworth, P. E. Dunne, A. M. Gibbons, M. Zito Leafy spanning trees in hypercubes, Technical Report CTAG-97008, University of Liverpool, 1997. 686
6. G. Galbiati, F. Maffioli, A. Morzenti A short note on the approximability of the maximum leaves spanning tree problem, Information Processing Letters 52, pages 45–49, 1994. 686
7. M. R. Garey, D. S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman, San Francisco 1979. 686, 687
8. R. Greenlaw, R. Petreschi Cubic graphs, ACM Computing Surveys, 27, pages 471-495, 1995. 687
9. J. R. Griggs, D. J. Kleitman, A. Shastri Spanning trees with many leaves in cubic graphs, Journal of Graph Theory 13, pages 669–695, 1989. 686
10. S. Guha, S. Khuller Approximation algorithms for connected dominating sets, Proceedings of Fourth Annual European Symposium on Algorithms, pages 179–193, 1996.
11. S. Guha, S. Khuller Improved methods for approximating node weight Steiner trees and connected dominating sets, Technical Report CS-TR-3849, University of Maryland, 1997.
12. D. J. Kleitman, D. B. West Spanning trees with many leaves, SIAM Journal ofDiscrete Mathematics 4, pages 99–106, 1991. 686
13. H. Lu, R. Ravi The power of local optimization: approximation algorithms for maximum-leaf spanning tree, Proceedings of the Thirtieth Annual Allerton Conference on Communication, Control and Computing, pages 533–542, 1992. 686
14. P. Lemke The maximum leaf spanning tree problem for cubic graphs is NPcomplete, IMA Preprint Series nr. 428, Minneapolis, 1988. 687
15. H. Lu, R. Ravi A near-linnear time approximation algorithm for maximum leaf spanning tree, Journal of Algorithms, Vol. 29, No. 1, pages 132–141, 1998. 686, 687
16. R. Solis-Oba 2-approximation algorithm for finding a spanning tree with maximumnumber of leaves, Proceedings on the 6th Annual European Symposium on Algorithms, LNCS 1461, pages 441–452, 1998. 686, 687 698
17. J. A. Storer Constructing full spanning trees for cubic graphs, Information Processing Letters 13, pages 8–11, 1981. 686