783 search results - page 41 / 157 » Improved approximation algorithms for the freeze-tag problem |
187
click to vote
SODA
1992
ACM
15 years 6 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
163
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
172
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
192
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
193
click to vote
ISAAC
2000
Springer
15 years 9 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...