| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949157 | Computational Geometry | 2017 | 12 Pages |
Abstract
This gives us a 2.37-factor approximation with a running time of O(|P|logâ¡|P|) suitable for fast practical computations. The approximation factor reduces to 1.63 by applying Arora's approximation scheme in the plane.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Stephan Held, Nicolas Kämmerling,