Highly Influenced

# On the Parsimonious Property of Connectivity Problems

@inproceedings{Goemans1990OnTP, title={On the Parsimonious Property of Connectivity Problems}, author={Michel X. Goemans and Dimitris Bertsimas}, booktitle={SODA}, year={1990} }

- Published 1990 in SODA

We consider the problem of designing a network with edge-connectivity requirements. As special cases, this problem encompasses the Steiner tree problem and the traveling salesman problem (TSP). We establish a property, referred to as the parsimonious property, of the linear programming (LP) relaxation of a classical formulation for the problem. The parsimonious property has several important consequences, both algorithmically and theoretically. Among other results, we derive a tight worst-case… CONTINUE READING

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=320224.