The maximum-leaf spanning tree problem: Formulations and facets

Networks

Volumn 43, Issue 4, 2004, Pages 212-223

  Fujie, Tetsuya ^a  

^a UNIVERSITY OF HYOGO   (Japan)

Author keywords

Facets; Integer programming; Spanning trees; Valid inequalities

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

INTEGER PROGRAMMING FACETS; SPANNING TREES; VALID INEQUALITIES;

INTEGER PROGRAMMING;

EID: 3042615178     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20001     Document Type: Article

References (14)

1. J.A. Bondy and U.S.R. Murty, Graph theory with applications, MacMillan Press, London, 1976.
2. L.M. Fernandes and L. Gouveia, Minimal spanning trees with a constraint on the number of leaves, Eur J Operat Res 104 (1998), 250-261.
3. T. Fujie, An exact algorithm for the maximum leaf spanning tree problem, Comput Operat Res 30 (2003), 1931-1944.
4. K. Fukuda, cdd/cdd+ Reference manual, Institute for Operations Research, Swiss Federal Institute of Technology, Zurich, Switzerland, 1997.
5. G. Galbiati, F. Maffioli, and A. Morzenti, A short note on the approximability of the maximum leaves spanning tree problem, Informat Process Lett 52 (1994), 45-49.
6. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, New York, 1979.
7. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Proceedings of the Fourth Annual European Symposium on Algorithms, 1996, pp. 179-193.
8. H. Lu and R. Ravi, The power of local optimization: Approximation algorithms for maximum-leaf spanning tree, Thirtieth Annual Allerton Conference on Communication, Control and Computing, 1992, pp. 533-542.
9. H. Lu and R. Ravi, Approximating maximum leaf spanning trees in almost linear time, J Algorithms 29 (1998), 132-141.
10. T.L. Magnanti and L.A. Wolsey, "Optimal trees," in Network models, M. Ball et al. (Editors), North-Holland, Amsterdam, 1995.
11. G.L. Nemhauser and L.A. Wosley, Integer and combinatorial optimization, Wiley, New York, 1988.
12. R. Solis-Oba, 2-Approximation algorithm for finding a spanning tree with maximum number of leaves, Lecture Notes Comput Sci 1461 (1998), 441-452.
13. J.A. Storer, Constructing full spanning trees for cubic graphs, Informat Process Lett 13 (1981), 8-11.
14. W.T. Tutte, "Graph theory," Encyclopedia of mathematics and its applications, vol. 21, Addison-Wesley Publishing Company, Menlo Park, CA, 1984.