The Robust Set Problem: Parameterized Complexity and Approximation

DOI10.1007/978-3-642-32589-2_15zbMath1365.68271OpenAlexW1837754425MaRDI QIDQ2912715

Morgan Chopin, Cristina Bazgan

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (2)

Data reductions and combinatorial bounds for improved approximation algorithms ⋮ The complexity of finding harmless individuals in social networks

This page was built for publication: The Robust Set Problem: Parameterized Complexity and Approximation