Oct 1, 2009 · Abstract:We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by ...
Abstract. We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the par- tition LP relaxation introduced by Könemann et al.
In this paper we prove new properties of hypergraphic linear programming relaxations for the Steiner tree problem. In particular, we show that a ...
scholar.google.com › citations
Abstract. We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Köne- mann et al.
Abstract. In this paper we prove new properties of hypergraphic linear programming relaxations for the Steiner tree problem. In particular, we show that a ...
Abstract. In this paper we prove new properties of hypergraphic linear programming relaxations for the Steiner tree problem. In particular, we show that a ...
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Könemann et al. [Math.
Abstract. We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Köne- mann et al.
Abstract. We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Könemann et al.
In this paper we prove new properties of hypergraphic linear programming relaxations for the Steiner tree problem. In particular, we show that a ...