Refine
Year of publication
- 2009 (3) (remove)
Document Type
- In Proceedings (2)
- ZIB-Report (1)
Language
- English (3)
Is part of the Bibliography
- no (3)
Keywords
- Connectivity (1)
- Generalization (1)
- Partition Inequalities (1)
- Paths (1)
- Steiner Tree (1)
Institute
The Steiner connectivity problem is a generalization of the Steiner tree problem. It consists in finding a minimum cost set of simple paths to connect a subset of nodes in an undirected graph. We show that polyhedral and algorithmic results on the Steiner tree problem carry over to the Steiner connectivity problem, namely, the Steiner cut and the Steiner partition inequalities, as well as the associated polynomial time separation algorithms, can be generalized. Similar to the Steiner tree case, a directed formulation, which is stronger than the natural undirected one, plays a central role.