3 search results - page 1 / 1 » Vertex Sparsifiers and Abstract Rounding Algorithms |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
IPCO
2004
13 years 8 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...
ENDM
2010
13 years 7 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...