186 search results - page 1 / 38 » Improved approximation algorithms for directed Steiner fores... |
ECCC
2007
14 years 11 months ago
2007
87
Voted
SIAMCOMP
2008
14 years 11 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
106
Voted
ICALP
2011
Springer
14 years 2 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
87
Voted
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...