APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
2002 ◽
Vol 12
(01n02)
◽
pp. 67-85
◽
Keyword(s):
We study (1+ε)-factor approximation algorithms for several well-known optimization problems on a given n-point set: (a) diameter, (b) width, (c) smallest enclosing cylinder, and (d) minimum-width annulus. Among our results are new simple algorithms for (a) and (c) with an improved dependence of the running time on ε, as well as the first linear-time approximation algorithm for (d) in any fixed dimension. All four problems can be solved within a time bound of the form O(n+ε-c) or O(n log (1/ε)+ε-c).
2005 ◽
Vol 1
(1)
◽
pp. 107-122
◽
2016 ◽
pp. 293-306
◽
2011 ◽
Vol 474-476
◽
pp. 924-927
◽
2002 ◽
Vol 13
(04)
◽
pp. 613-627
◽
2000 ◽
Vol 29
(5)
◽
pp. 1568-1576
◽
2000 ◽
pp. 60-71
◽
2006 ◽
Vol 16
(02n03)
◽
pp. 227-248
◽
Keyword(s):