1486 search results - page 26 / 298 » Algorithms for two-box covering |
STOC
1999
ACM
15 years 5 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
77
Voted
STOC
2005
ACM
16 years 1 months ago
2005
ACM
61
Voted
SODA
2000
ACM
15 years 2 months ago
2000
ACM
101
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
92
Voted
MP
1998
15 years 14 days ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...