29 search results - page 2 / 6 » Approximability of the Maximum Solution Problem for Certain ... |
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
CSR
2007
Springer
13 years 11 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
MST
2010
13 years 3 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
STOC
1995
ACM
13 years 8 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...