Low degree spanning trees of small weight
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Approximation schemes for minimum latency problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We develop a quasi-polynomial time approximation scheme for the Euclidean version of the Degree-restricted MST by adapting techniques used previously for approximating TSP. Given n points in the plane, d = 2 or 3, and Ɛ 0, the scheme finds an approximation with cost within 1+Ɛ of the lowest cost spanning tree with the property that all nodes have degree at most d. We also develop a polynomial time approximation scheme for the Euclidean version of the Red-Blue Separation Problem.