Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
From MaRDI portal
Publication:4635534
DOI10.1145/2582112.2582157zbMath1395.68306arXiv1312.1369OpenAlexW2039079162MaRDI QIDQ4635534
Publication date: 23 April 2018
Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1369
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (17)
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set ⋮ Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ A QPTAS for the base of the number of crossing-free structures on a planar point set ⋮ Literature survey on low rank approximation of matrices ⋮ An improvement of the parameterized frequent directions algorithm ⋮ Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking ⋮ Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs ⋮ Packing and covering with non-piercing regions ⋮ Anchored rectangle and square packings ⋮ Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs ⋮ Unnamed Item ⋮ Optimality program in segment and string graphs ⋮ Local search strikes again: PTAS for variants of geometric covering and packing ⋮ Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
This page was built for publication: Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
