1142 search results - page 40 / 229 » Approximability of Clausal Constraints |
126
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
120
click to vote
ANOR
2004
15 years 1 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
100
click to vote
SIAMCOMP
2000
15 years 1 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
151
click to vote
SIAMCOMP
1998
15 years 1 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
103
click to vote
DAM
2010
15 years 2 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 ...