The maximum-leaf spanning tree problem: Formulations and facets

Authors:
Affiliations:
Venue:
Networks
Year:
2004

Citing 0
Cited 3

Spanning trees with many leaves in regular bipartite graphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Reformulation by intersection method on the MST problem with lower bound on the number of leaves

INOC'11 Proceedings of the 5th international conference on Network optimization
The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm

INOC'11 Proceedings of the 5th international conference on Network optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.