26 search results - page 1 / 6 » On Approximating Four Covering and Packing Problems |
91
Voted
CORR
2011
Springer
14 years 5 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...
102
click to vote
SODA
2001
ACM
15 years 7 days 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...
144
Voted
ESCAPE
2007
Springer
15 years 5 months ago
2007
Springer
122
Voted
WAOA
2004
Springer
15 years 4 months ago
2004
Springer
78
Voted
FOCS
1991
IEEE
15 years 2 months ago
1991
IEEE
