7150 search results - page 280 / 1430 » An Approximation Algorithm for Approximation Rank |
156
click to vote
APPROX
2005
Springer
16 years 6 days ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
152
click to vote
SMI
2003
IEEE
15 years 12 months ago
2003
IEEE
Reverse engineering allows the geometric reconstruction of simple mechanical parts. However, the resulting models suffer from inaccuracies caused by errors in measurement and reco...
176
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
198
click to vote
COLOGNETWENTE
2007
15 years 8 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
167
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...