The Parameterized Complexity of the Unique Coverage Problem

DOI10.1007/978-3-540-77120-3_54zbMath1193.68139OpenAlexW1533622011MaRDI QIDQ5387796

Venkatesh Raman, Somnath Sikdar, Hannes Moser

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_54

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

The parameterized complexity of unique coverage and its variants ⋮ Parameterized complexity of Eulerian deletion problems ⋮ On nonlinear multi-covering problems ⋮ The Budgeted Unique Coverage Problem and Color-Coding

Cites Work

• Non deterministic polynomial optimization problems and their approximations
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Combination can be hard
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Parameterized Complexity of the Unique Coverage Problem