Approximation Algorithms for Domination Search
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.
KeywordsDomination search graph minors approximation algorithms
Unable to display preview. Download preview PDF.
- 4.Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS, pp. 270–279. IEEE Computer Society, Los Alamitos (2007)Google Scholar
- 5.Demaine, E.D., Hajiaghayi, M.T., Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 637–646. IEEE Computer Society, Los Alamitos (2005)CrossRefGoogle Scholar
- 8.Fomin, F.V., Golovach, P.A., Thilikos, D.M.: Approximating acyclicity parameters of sparse hypergraphs. In: Albers, S., Marion, J.-Y. (eds.) STACS, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. LIPIcs, vol. 3, pp. 445–456 (2009)Google Scholar
- 20.Parsons, T.D.: The search number of a connected graph. In: Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing. Congress. Numer., Utilitas Math., vol. XXI, pp. 549–554 (1978)Google Scholar