447 search results - page 1 / 90 » Approximation Algorithms for Directed Steiner Problems |
SODA
1998
ACM
13 years 6 months ago
1998
ACM
JISE
2006
13 years 5 months ago
2006
SODA
2003
ACM
13 years 6 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...
ORL
2007
13 years 4 months ago
2007
STOC
2010
ACM
13 years 10 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 ...