论文信息 - The maximum‐leaf spanning tree problem: Formulations and facets

The maximum‐leaf spanning tree problem: Formulations and facets

The Maximum Leaf Spanning Tree Problem (MLSTP) is to find a spanning tree in a given undirected graph, whose number of leaves (vertices of degree 1) is maximum. In this article, we consider an integer programming approach to the MLSTP. We provide two formulations of the MLSTP and study the facial structure of polytopes arising from the formulations. Moreover, several relaxation problems are compared. © 2004 Wiley Periodicals, Inc.

Tetsuya Fujie | T. Fujie

[1] Samir Khuller,et al. Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[2] W. T. Tutte. Graph Theory , 1984 .

[3] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .

[4] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[5] Francesco Maffioli,et al. A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem , 1994, Inf. Process. Lett..

[6] Roberto Solis-Oba,et al. A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves , 1998, Algorithmica.

[7] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .

[8] Luis Gouveia,et al. European Journal of Operational Research Minimal Spanning Trees with a Constraint on the Number of Leaves , 2022 .

[9] R. Ravi,et al. Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.

[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[12] James A. Storer,et al. Constructing Full Spanning Trees for Cubic Graphs , 1981, Inf. Process. Lett..

[13] Peter Eades,et al. On Optimal Trees , 1981, J. Algorithms.