3 search results - page 1 / 1 » Vertex Sparsifiers and Abstract Rounding Algorithms |
59
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
106
click to vote
IPCO
2004
14 years 11 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
104
click to vote
ENDM
2010
14 years 10 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...