Approximation Schemes for Independent Set and Sparse Subsets of Polygons
From MaRDI portal
Publication:5215458
DOI10.1145/3326122zbMath1473.68215arXiv1703.04758OpenAlexW2604794478MaRDI QIDQ5215458
Anna Adamaszek, Andreas Wiese, Sariel Har-Peled
Publication date: 11 February 2020
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.04758
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (3)
Tight approximation algorithms for geometric bin packing with skewed items ⋮ Peak demand minimization via sliced strip packing ⋮ Optimality program in segment and string graphs
This page was built for publication: Approximation Schemes for Independent Set and Sparse Subsets of Polygons