A quasi-polynomial time approximation scheme for minimum weight triangulation
From MaRDI portal
Publication:5891924
DOI10.1145/1132516.1132563zbMath1301.05339OpenAlexW2090507375MaRDI QIDQ5891924
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132563
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (6)
A linear time algorithm for max-min length triangulation of a convex polygon ⋮ Approximation schemes for node-weighted geometric Steiner tree problems ⋮ A new asymmetric inclusion region for minimum weight triangulation ⋮ A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing ⋮ Minimum weight convex Steiner partitions ⋮ An almost four-approximation algorithm for maximum weight triangulation
This page was built for publication: A quasi-polynomial time approximation scheme for minimum weight triangulation
