Searching a fixed graph
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
We study three combinatorial optimization problems related to searching a graph that is known in advance, for an item that resides at an unknown node. The search ratio of a graph is the optimum competitive ratio (the worst-case ratio of the distance traveled before the unknown node is visited, over the distance between the node and a fixed root, minimized over all Hamiltonian walks of the graph). We also define the randomized search ratio (we minimize over all distributions of permutations). Finally, the traveling repairman problem seeks to minimize the expected time of visit to the unknown node, given some distribution on the nodes. All three of these novel graph-theoretic parameters are NP-complete —and MAXSNP-hard — to compute exactly; we present interesting approximation algorithms for each. We also show that the randomized search ratio and the traveling repairman problem are related via duality and polyhedral separation.
- F. Afrati, S. Cosmadakis, C. H. Papadimitriou, G. Papageorgiou, and N. Papakostantinou. The complexity of the travelling repairman problem. Informatique Theórique et Applications, 20(1):79–87, 1986.
- R.A. Baeza-Yates, J.C. Culberson, and G.J.E. Rawlins. Searching with uncertainty. SWAT 88. 1st Scandinavian Workshop on Algorithm Theory. Proceedings, pages 176–89, 1988.
- A. Blum, P. Chalasani, D. Coppersmith, W. Pulleyblank, P. Raghavan, and M. Sudan. The minimum latency problem. Proceedings 26th Annual Symposium on Theory of Computing, pages 163–171, 1994.
- N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, Carnegie-Mellon University, 1976.
- X. Deng, T. Kameda, and C. Papadimitriou. How to learn an unknown environment. Proceedings 32nd Annual Symposium on Foundations of Computer Science, pages 298–303, 1991.
- X. Deng and C. H. Papadimitriou. Exploring an unknown graph. Proceedings 31st Annual Symposium on Foundations of Computer Science, pages 355–361 vol. 1, 1990.
- M. Fischetti, G. Laporte, and M. Martello. The delivery man problem and cumulative matroids. Operations Research, vol. 41, pages 1055–1064, 1993.
- M. Goemans and J. Kleinberg. An improved approximation ratio for the minimum latency problem. Proceedings Annual Symposium on Discrete Algorithms, to appear, 1996.
- M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization. Springer-Verlag, 1988.
- E. Minieka. The delivery man problem on a tree network. Annals of Operations Research, vol. 18, pages 261–266, 1989.
- S.A. Plotkin, D.B. Shmoys, and É. Tardos. Fast approximation algorithms for fractional packing and covering problems. Proceedings 32nd Annual Symposium on Foundations of Computer Science, pages 495–504, 1991.
- C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84(1):127–50, July 1991. CrossRef
- C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Mathematics of Operations Research, 18(1):1–11, February 1993.
- D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202–8, February 1985. CrossRef
- É. Tardos. Private communication, 1995.
- D. West. Private communication, 1995.
- T. G. Will. Extremal Results and Algorithms for Degree Sequences of Graphs. PhD thesis, U. of Illinois at Urbana-Champaign, 1993.
- Searching a fixed graph
- Book Title
- Automata, Languages and Programming
- Book Subtitle
- 23rd International Colloquium, ICALP '96 Paderborn, Germany, July 8–12, 1996 Proceedings
- pp 280-289
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.