1671 search results - page 27 / 335 » On the Covering Steiner Problem |
SIAMCOMP
1998
13 years 10 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
IPCO
2010
14 years 11 days ago
2010
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
HM
2007
Springer
14 years 5 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
SODA
1990
ACM
14 years 3 days ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...