Capacitated Domination and Covering: A Parameterized Perspective

DOI10.1007/978-3-540-79723-4_9zbMath1142.68371MaRDI QIDQ3503580

Saket Saurabh, Daniel Lokshtanov, Yngve Villanger, Michael Dom

Publication date: 5 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79723-4_9

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

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