A heuristic triangulation algorithm
Journal of Algorithms
An O(n2logn) time algorithm for the minmax angle triangulation
SIAM Journal on Scientific and Statistical Computing
A quadratic time algorithm for the minmax length triangulation
SIAM Journal on Computing
Polynomial-time instances of the minimum weight triangulation problem
Computational Geometry: Theory and Applications
Computing a subgraph of the minimum weight triangulation
Computational Geometry: Theory and Applications
Approaching the largest &bgr;-skeleton within a minimum weight triangulation
Proceedings of the twelfth annual symposium on Computational geometry
On computing edges that are in all minimum-weight triangulations
Proceedings of the twelfth annual symposium on Computational geometry
Approximation algorithms for geometric 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
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Quasi-greedy triangulations approximating the minimum weight triangulation
Journal of Algorithms
Quasi-greedy triangulations approximating the minimum weight triangulation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On exclusion regions for optimal triangulations
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
ACM SIGACT News
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Which Triangulations Approximate the Complete Graph?
Proceedings of the International Symposium on Optimal 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
Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
Minimum weight pseudo-triangulations
Computational Geometry: Theory and Applications
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
On triangulations of a set of points in the plane
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Minimum weight triangulation by cutting out triangles
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On a linear program for minimum-weight triangulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
The Minimum Weight Triangulation problem is to find a triangulation T* of minimum length for a given set of points P in the Euclidean plane. It was one of the few longstanding open problems from the famous list of twelve problems with unknown complexity status, published by Garey and Johnson [1979]. Very recently, the problem was shown to be NP-hard by Mulzer and Rote [2006]. In this article, we present a quasi-polynomial time approximation scheme for Minimum Weight Triangulation.