Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (4) , 1298-1309
- https://doi.org/10.1137/s0097539796309764
Abstract
No abstract availableThis publication has 1 reference indexed in Scilit:
- A Constant-Factor Approximation Algorithm for the Geometrick-MST Problem in the PlaneSIAM Journal on Computing, 1998