3875 search results - page 45 / 775 » Approximation algorithms for the 0-extension problem |
64
Voted
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
COCO
1997
Springer
15 years 1 months ago
1997
Springer
69
Voted
SODA
2000
ACM
14 years 11 months ago
2000
ACM
CCCG
2006
14 years 11 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
89
Voted
MP
1998
14 years 9 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...