An exact algorithm for the maximum leaf spanning tree problem

Computers and Operations Research

Volumn 30, Issue 13, 2003, Pages 1931-1944

  Fujie, Tetsuya ^a  

^a UNIVERSITY OF HYOGO   (Japan)

Author keywords

Branch and bound; Integer programming; Spanning trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING;

LEAF SPANNING TREE PROBLEM;

TREES (MATHEMATICS);

GRAPHICAL METHOD;

EID: 0042812479     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00117-X     Document Type: Article

References (14)

1. Guha S, Khuller S. Approximation algorithms for connected dominating sets. Proceedings of the Fourth Annual European Symposium on Algorithms, 1996. p. 179-93.
2. Storer JA. Constructing full spanning trees for cubic graphs. Information Processing Letters 1981;13:8-11.
3. Fernandes LM, Gouveia L. Minimal spanning trees with a constraint on the number of leaves. European Journal of Operational Research 1998;104:250-61.
4. Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. New York: W. H. Freeman & Co., 1979.
5. Galbiati G, Maffioli F, Morzenti A. A short note on the approximability of the maximum leaves spanning tree problem. Information Processing Letters 1994;52:45-9.
6. Lu H, Ravi R. The power of local optimization: approximation algorithms for maximum-leaf spanning tree. Thirtieth Annual Allerton Conference on Communication, Control and Computing, 1992. p. 533-42.
7. Lu H, Ravi R. Approximating maximum leaf spanning trees in almost linear time. Journal of Algorithms 1998;29: 132-41.
8. Solis-Oba S. 2-approximation algorithm for finding a spanning tree with maximum number of leaves. Lecture notes in computer science, vol. 1461, 1998. p. 441-52.
9. Feige U. A threshold of ln n for approximating set cover. Journal of the ACM 1998;25:634-52.
10. Fujie T. The maximum-leaf spanning tree problem: formulations and facets. Preprint, 1998. Submitted for publication.
11. Prim RC. Shortest connection networks and some generalizations. Bell Systems Technical Journal 1957;36: 1389-401.
12. Geoffrion AM. Lagrangian relaxation for integer programming. Mathematical Programming Study 1974;2:82-114.
13. Kleitman DJ, West DB. Spanning trees with many leaves. SIAM Journal on Discrete Mathematics 1991;4:99-106.
14. Shinano Y, Harada K, Hirabayashi R. Control schemes in a generalized utility for parallel branch-and-bound algorithms. In: Proceedings of the 11th International Parallel Processing Symposium, 1997. p. 621-7.