Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs

DOI10.1007/s00453-019-00670-wzbMath1433.68307MaRDI QIDQ1987245

Michał Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese

Publication date: 14 April 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9528/

zbMATH Keywords

planar graphs; approximation schemes; geometric set cover; independent set of objects

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C10: Planar graphs; geometric and topological aspects of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms