Thumbnail
Access Restriction
Subscribed

Author Remy, Jan ♦ Steger, Angelika
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2009
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Minimum weight triangulation ♦ Approximation algorithms
Abstract The Minimum Weight Triangulation problem is to find a triangulation $\textit{T*}$ of minimum length for a given set of points $\textit{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 $\textit{NP}-hard$ by Mulzer and Rote [2006]. In this article, we present a quasi-polynomial time approximation scheme for Minimum Weight Triangulation.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2009-05-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 56
Issue Number 3
Page Count 47
Starting Page 1
Ending Page 47


Open content in new tab

   Open content in new tab
Source: ACM Digital Library