Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Approximation Algorithms for Domination Search
verfasst von : Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Erschienen in: Approximation and Online Algorithms
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The
r
-domination search game on graphs is a game-theoretical approach to the investigation of several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify the minimum number of cops sufficient to catch the visible and fast robber. In
r
-domination search, the robber is being arrested if he resides inside a ball of radius
r
around some cop. In this setting, the power of the cops does not depend only on how many they are but also on the local topology of the graph around them. This is the main reason why the approximation complexity of the
r
-domination search game varies considerably, depending on whether
r
= 0 or
r
≥ 1. We prove that this discrepancy is canceled when the game is played in (non-trivial) graph classes that are closed under taking of minors. We give a constant factor approximation algorithm that for every fixed
r
and graph
H
, computes the minimum number of cops required to capture the robber in the
r
-domination game on graphs excluding
H
as a minor.