SIAMCOMP
2008
13 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...
COCOA
2008
Springer
14 years 1 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...
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
STOC
2009
ACM
15 years 2 days ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...