Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
Minimum-weight triangulation is NP-hard
Journal of the ACM (JACM)
The relative neighbourhood graph is a part of every 30°-triangulation
Information Processing Letters
A quasi-polynomial time approximation scheme for minimum weight triangulation
Journal of the ACM (JACM)
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
On a linear program for minimum-weight triangulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |