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

DOI10.1016/J.IPL.2014.03.002MaRDI QIDQ2448113zbMATH OpenOpenAlexFDO

Authors 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

triangulationapproximation algorithmstime complexityplanar 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)

Recommendations

• A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices
• A quasi-polynomial time approximation scheme for minimum weight triangulation
• Computing and Combinatorics
• A quasi-polynomial time approximation scheme for minimum weight triangulation
• Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs

Cites work

• A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices
• A quasi-polynomial time approximation scheme for minimum weight triangulation
• An almost four-approximation algorithm for maximum weight triangulation
• Computing and Combinatorics
• Minimum-weight triangulation is NP-hard
• Progress on maximum weight triangulation
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

Cited in

(1)

• A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices

This page was built for publication: A note on a QPTAS for maximum weight triangulation of planar point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448113)