Unique Covering Problems with Geometric Sets

DOI10.1007/978-3-319-21398-9_43zbMath1391.68103MaRDI QIDQ3196414

Saket Saurabh, Neeldhara Misra, Pradeesha Ashok, Sudeshna Kolay

Publication date: 29 October 2015

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-21398-9_43

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

94C15: Applications of graph theory to circuits and networks