Guard Games on Graphs: Keep the Intruder Out!

DOI10.1007/978-3-642-12450-1_14zbMath1284.91075OpenAlexW2113378957WikidataQ60488686 ScholiaQ60488686MaRDI QIDQ3558922

Daniel Lokshtanov, Petr A. Golovach, Fedor V. Fomin

Publication date: 11 May 2010

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12450-1_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

To satisfy impatient web surfers is hard ⋮ Guard games on graphs: keep the intruder out!

This page was built for publication: Guard Games on Graphs: Keep the Intruder Out!