A note on a QPTAS for maximum weight triangulation of planar point sets

DOI10.1016/j.ipl.2014.03.002zbMath1296.68196OpenAlexW2063221736MaRDI QIDQ2448113

Christos Levcopoulos, Andrzej Lingas

Publication date: 30 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.03.002

zbMATH Keywords

triangulationtime complexityapproximation algorithmsplanar straight-line graphquasi-polynomial time approximation schememaximum weight triangulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• An almost four-approximation algorithm for maximum weight triangulation
• Progress on maximum weight triangulation
• Minimum-weight triangulation is NP-hard
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
• Computing and Combinatorics
• A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
• A quasi-polynomial time approximation scheme for minimum weight triangulation