Independent Set of Convex Polygons: from n^ to 1+ via shrinking

DOI10.1007/978-3-662-49529-2_52MaRDI QIDQ2802979zbMATH OpenOpenAlexFDO

Authors Andreas Wiese

Publication date 3 May 2016

Published in LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49529-2_52

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
• Approximation schemes for independent set and sparse subsets of polygons
• Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
• A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices
• Algorithm Theory - SWAT 2004

Cited in

(4)

• Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
• Quasi-polynomial time approximation scheme for sparse subsets of polygons
• Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
• Approximation schemes for independent set and sparse subsets of polygons

This page was built for publication: Independent Set of Convex Polygons: from \(n^{\epsilon }\) to \(1+\epsilon\) via shrinking

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