On the spanning tree polyhedron

Authors:
Sunil Chopra
Affiliations:
Graduate School of Business Administration, 100 Trinity Place, New York, NY 10006, USA
Venue:
Operations Research Letters
Year:
1989

Citing 0
Cited 2

Separating from the dominant of the spanning tree polytope

Operations Research Letters
Online prediction under submodular constraints

ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fulkerson [4] characterized the blocking matrix to the incidence matrix of all spanning trees of the graph. This paper gives a simple constructive proof of this characterization using a minimum spanning tree algorithm. We also identify all inequalities that are facets.