Download:
|
by Bernhard Von Stengel, Ralph Werchner
http://www.maths.lse.ac.uk/Personal/stengel/TEXTE/graphsearch.ps.gz
Add To MetaCart
Abstract:
(page numbers in this manuscript match only approximately) Abstract. We study the computational complexity of certain search-hide games on a graph. There are two players, called searcher and hider. The hider is immobile and hides in one of the nodes of the graph. The searcher selects a starting node and a search path of length at most k. His objective is to detect the hider, which he does with certainty if he visits the node chosen for hiding. Finding the optimal randomized strategies in this zero-sum game defines a fractional path covering problem and its dual, a fractional packing problem. If the length k of the search path is arbitrary, then the problem is NP-hard. The problem remains NP-hard if the searcher may freely revisit nodes that he has seen before. In that case, the searcher selects a connected subgraph of k nodes rather than a path of k nodes. If k is logarithmic in the number of nodes of the graph, then the problem can be solved in polynomial time. This is shown using a recent technique called color-coding due to Alon, Yuster, and Zwick. The same results hold for edges instead of nodes, that is, if the hider hides in an edge and the searcher searches k edges on a path or on a connected subgraph. Keywords. Covering and packing, game theory, graph search, NP-completeness. 1
Citations
|
1588
|
Computational Complexity
– Papadimitriou
- 1994
|
|
972
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
833
|
Reducibility among Combinatorial Problems
– Karp
- 1972
|
|
782
|
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2. SpringerVerlag
– Grötschel, Lovász, et al.
- 1988
|
|
731
|
Integer and Combinatorial Optimization
– Nemhauser, Wolsey
- 1988
|
|
313
|
Matching Theory
– Lovász, Plummer
- 1986
|
|
232
|
Reducibility among combinatorial problems, Complexity of Computer Computations
– Karp
- 1972
|
|
72
|
The complexity of searching a graph
– Megiddo, Hakimi, et al.
- 1988
|
|
56
|
Monotonicity in graph searching
– Bienstock, Seymour
- 1991
|
|
35
|
Eavesdropping games: A graph-theoretic approach to privacy in distributed systems
– Franklin, Galil, et al.
- 1993
|
|
26
|
How to find long paths efficiently
– Monien
- 1985
|
|
24
|
Weighted kCardinality Trees: Complexity and Polyhedral Structure
– Fischetti, Hamacher, et al.
- 1994
|
|
24
|
Properties of vertex packing and independence system polyhedra
– Nemhauser, Trotter
- 1974
|
|
17
|
Search Games
– Gal
- 1980
|
|
15
|
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs
– Alon, Yuster, et al.
- 1995
|
|
13
|
A Survey of the Search Theory Literature
– Benkoski, Monticino, et al.
- 1991
|
|
7
|
Search Problems
– Ahlswede, Wegener
- 1987
|
|
7
|
Inspection games
– Avenhaus, Stengel, et al.
- 1995
|
|
5
|
The complexity of the optimal searcher path problem
– Trummel, Weisinger
- 1986
|
|
4
|
Discrete sequential search with positive switch cost
– Lössner, Wegener
- 1982
|
|
3
|
A survey of the search theory literature, Naval Research Logistics 38
– Benkoski, Monticino, et al.
- 1991
|
|
2
|
et al., eds., The Traveling Salesman Problem
– Lawler
- 1985
|
|
1
|
Search-hide games on trees
– Cao
- 1993
|
|
1
|
Search-hide games on graphs
– Cao, Stengel
- 1993
|
|
1
|
Pursuit-evasion games on graphs
– Chung, Cohen, et al.
- 1988
|
|
1
|
et al., The complexity of searching a graph
– Megiddo
- 1988
|
|
1
|
Optimal search with positive switch cost is NP-hard
– Wegener
- 1985
|
|
1
|
Continuous search games. In: Search Theory -- Some Recent Developments
– Gal
- 1989
|
