Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

WAOA
2010
Springer

favoriteEmaildiscussreport

232views Algorithms» more WAOA 2010»

Approximation Algorithms for Domination Search

13 years 2 months ago

Approximation Algorithms for Domination Search

Download users.uoa.gr

The r-domination search game on graphs is a game-theoretical approach to 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

Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi

Real-time Traffic

Algorithms | Fast Robber | R-domination Search | R-domination Search Game | WAOA 2010 |

claim paper

Related Content

» Convergence of stochastic search algorithms to gapfree pareto front approximations

» Distributed Approximation Algorithms for Weighted Problems in MinorClosed Families

» Direct Policy Search Reinforcement Learning for Robot Control

» Approximation Algorithms for Connected Dominating Sets

» Approximation Algorithms for Dominating Set in Disk Graphs

» A SelfStabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating...

» Approximately Dominating Representatives

» Dominance learning in diploid genetic algorithms for dynamic optimization problems

» Approximating minimum independent dominating sets in wireless networks

Post Info
More Details (n/a)

Added	15 Feb 2011
Updated	15 Feb 2011
Type	Journal
Year	2010
Where	WAOA
Authors	Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos

Comments (0)