186 search results - page 4 / 38 » Improved approximation algorithms for directed Steiner fores... |
90
Voted
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
SODA
2003
ACM
14 years 11 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...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
JISE
2006
14 years 9 months ago
2006
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...