Approximating low-dimensional coverage problems

DOI10.1145/2261250.2261274zbMath1293.68281arXiv1112.0689OpenAlexW2172162445MaRDI QIDQ2874577

Hooyeon Lee, Ashwinkumar Badanidiyuru, Robert D. Kleinberg

Publication date: 7 August 2014

Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0689

zbMATH Keywords

fixed-parameter tractable

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (8)

Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs ⋮ Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs ⋮ Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7 ⋮ Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parameterized and approximation complexity of \textsc{Partial VC Dimension} ⋮ Critical nodes in interdependent networks with deterministic and probabilistic cascading failures

This page was built for publication: Approximating low-dimensional coverage problems