26 search results - page 1 / 6 » On Approximating Four Covering and Packing Problems |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
16
Voted
SODA
2001
ACM
13 years 7 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...
ESCAPE
2007
Springer
14 years 16 days ago
2007
Springer
WAOA
2004
Springer
13 years 11 months ago
2004
Springer
FOCS
1991
IEEE
13 years 10 months ago
1991
IEEE
