The maximum-leaf spanning tree problem: Formulations and facets

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… (More)
DOI: 10.1002/net.20001

Topics

9 Figures and Tables

Cite this paper

@article{Fujie2004TheMS, title={The maximum-leaf spanning tree problem: Formulations and facets}, author={Tetsuya Fujie}, journal={Networks}, year={2004}, volume={43}, pages={212-223} }