4894 search results - page 17 / 979 » The Guarding Problem - Complexity and Approximation |
CP
2004
Springer
14 years 2 months ago
2004
Springer
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
RANDOM
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
DAM
2010
13 years 8 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
GBRPR
2005
Springer
14 years 2 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
FOCS
2000
IEEE
14 years 12 days 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 ...