1486 search results - page 26 / 298 » Algorithms for two-box covering |
STOC
1999
ACM
14 years 23 days 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...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
SODA
2000
ACM
13 years 9 months ago
2000
ACM
ESA
2010
Springer
13 years 9 months ago
2010
Springer
MP
1998
13 years 8 months 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...