130 search results - page 8 / 26 » Faster Approximation Algorithms for the Rectilinear Steiner ... |
STOC
2010
ACM
14 years 21 days 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 ...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
WG
2001
Springer
14 years 8 days ago
2001
Springer
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
SODA
2003
ACM
13 years 9 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...