5 search results - page 1 / 1 » Hypergraphic LP Relaxations for Steiner Trees |
IPCO
2010
13 years 5 months ago
2010
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K
IPCO
2008
13 years 5 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
MOR
2007
13 years 3 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
ENDM
2010
13 years 4 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...