82 search results - page 1 / 17 » Tight Approximation Results for General Covering Integer Pro... |
CORR
2002
Springer
15 years 7 days ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
110
Voted
SIAMCOMP
1998
15 years 2 days ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
78
Voted
MP
2006
15 years 11 days ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
133
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
127
click to vote
FOCS
1995
IEEE
15 years 4 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...