Parameterized complexity of geometric covering problems having conflicts

DOI10.1007/978-3-319-62127-2_6zbMath1436.68144OpenAlexW2731266069MaRDI QIDQ5920095

Saket Saurabh, Fahad Panolan, Aritra Banik, Venkatesh Raman, Vibha Sahlot

Publication date: 22 September 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-62127-2_6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Approximation algorithms for geometric conflict free covering problems

This page was built for publication: Parameterized complexity of geometric covering problems having conflicts