Parameterized complexity of geometric covering problems having conflicts

DOI10.1007/978-3-319-62127-2_6MaRDI QIDQ5920095zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Parameterized complexity of geometric covering problems having conflicts
• Parameterized complexity of conflict-free set cover
• Parameterized complexity of conflict-free set cover
• Approximation algorithms for geometric conflict free covering problems
• scientific article; zbMATH DE number 1947430

Cited in

(4)

• Approximation algorithms for geometric conflict free covering problems
• Parameterized complexity of conflict-free set cover
• Parameterized complexity of geometric covering problems having conflicts
• Parameterized complexity of conflict-free set cover

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5920095)