666 search results - page 3 / 134 » New primal-dual algorithms for Steiner tree problems |
IPCO
2008
13 years 7 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. ...
ICPADS
2007
IEEE
14 years 9 days ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
EVOW
2007
Springer
14 years 5 days ago
2007
Springer
The Steiner Tree Problem (STP) in graphs is a well-known
SODA
2003
ACM
13 years 7 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...