A Quasi-Polynomial Time Approximation Scheme for Minimum Weight Triangulation (2006)
| Venue: | Proceedings of the 38th ACM Symposium on Theory of Computing |
| Citations: | 6 - 0 self |
BibTeX
@INPROCEEDINGS{Remy06aquasi-polynomial,
author = {Jan Remy and Angelika Steger},
title = {A Quasi-Polynomial Time Approximation Scheme for Minimum Weight Triangulation},
booktitle = {Proceedings of the 38th ACM Symposium on Theory of Computing},
year = {2006},
pages = {316--325},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 [8] in 1979. Very recently the problem was shown to be NP-hard by Mulzer and Rote. In this paper, we present a quasi-polynomial time approximation scheme for Minimum Weight Triangulation.
