Complexity of searching an immobile hider in a graph

Discrete Applied Mathematics

Volumn 78, Issue 1-3, 1997, Pages 235-249

  Von Stengel, Bernhard ^a   Werchner, Ralph ^b  

^a ETH ZURICH   (Switzerland)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Covering and packing; Game theory; Graph search; NP completeness

Indexed keywords

EID: 30244534817     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00011-5     Document Type: Article

References (25)

1. R. Ahlswede and I. Wegener, Search Problems (Wiley, New York, 1987).
2. N. Alon, R. Yuster and U. Zwick, Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs, Proc. 26th ACM Symp. Theory of Computing (1994) 326-335.
3. R. Avenhaus, B. von Stengel and S. Zamir, Inspection games, in: R.J. Aumann and S. Hart, eds., Handbook of Game Theory, Vol. 3 (North-Holland, Amsterdam, to appear).
4. S. Benkoski, M.G. Monticino and J.R. Weisinger, A survey of the search theory literature, Naval Res. Logist. 38 (1991) 469-494.
5. D. Bienstock and P. Seymour, Monotonicity in graph searching, J. Algorithms 12 (1991) 230-245.
6. B. Cao, Search-hide games on trees, Eur. J. Oper. Res. 80 (1993) 175-183.
7. B. Cao and B. von Stengel, Search-hide games on graphs, Technical Report S-9303, University of the Federal Armed Forces Munich, Germany (1993).
8. F.R.K. Chung, J.E. Cohen and R.L. Graham, Pursuit-evasion games on graphs, J. Graph Theory 12 (1988) 159-167.
9. M. Fischetti, H.W. Harnacher, K. Jørnsten and F. Maiffioli, Weighted k-cardinality trees: complexity and polyhedral structure, Networks 24 (1994) 11-21.
10. M. Franklin, Z. Galil and M. Yung, Eavesdropping games: a graph-theoretic approach to privacy in distributed systems, Proc. 34th IEEE Symp. Foundations of Computer Science (1993) 670-679.
11. S. Gal, Search Games (Academic Press, New York, 1980).
12. S. Gal, Continuous search games, in: D.V. Chudnovsky and G.V. Chudnovsky, eds., Search Theory -Some Recent Developments (Dekker, New York, 1989) 33-53.
13. M. Grötschel, L. Lovâsz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
14. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations (Plenum, New York, 1972), 85-103.
15. E.L. Lawler et al., eds., The Traveling Salesman Problem (Wiley, Chichester, 1985).
16. U. Lössner and I. Wegener, Discrete sequential search with positive switch cost, Math. Oper. Res. 7 (1982) 426-440.
17. L. Lovász and M.D. Plummer, Matching Theory, Ann. Discrete Math., Vol. 29 (North-Holland, Amsterdam, 1986).
18. N. Megiddo et al., The complexity of searching a graph, J. ACM 35 (1988) 18-44.
19. B. Monien, How to find long paths efficiently, in: G. Ausiello and M. Lucertini, eds., Analysis and Design of Algorithms for Combinatorial Problems, Ann. Discrete Math., Vol. 25 (North-Holland, Amsterdam, 1985) 239-254.
20. G.L. Nemhauser and L.R. Trotter, Jr., Properties of vertex packing and independence system polyhedra, Math. Programming 6 (1974) 48-61.
21. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
22. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, 1994).
23. A. Schrijver, Theory of Linear and Integer Programming (Wiley, Chichester, 1986).
24. K.E. Trammel and J.R. Weisinger, The complexity of the optimal searcher path problem, Oper. Res. 34 (1986) 324-327.
25. I. Wegener, Optimal search with positive switch cost is NP-hard, Inform. Process. Lett. 21 (1985) 49-52.