Searching a Fixed Graph
暂无分享,去创建一个
Mihalis Yannakakis | Christos H. Papadimitriou | Elias Koutsoupias | E. Koutsoupias | M. Yannakakis | C. Papadimitriou
[1] George Papageorgiou,et al. The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..
[2] E. Minieka. The delivery man problem on a tree network , 1990 .
[3] Douglas B. West,et al. Extremal results and algorithms for degree sequences of graphs , 1993 .
[4] Xiaotie Deng,et al. How to learn an unknown environment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[5] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[6] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[7] Jon M. Kleinberg,et al. An improved approximation ratio for the minimum latency problem , 1996, SODA '96.
[8] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[9] Ricardo Baeza-Yates,et al. Searching with uncertainty , 1988 .
[10] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[11] Ricardo A. Baeza-Yates,et al. Searching with Uncertainty (Extended Abstract) , 1988, SWAT.
[12] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[13] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[14] Matteo Fischetti,et al. The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..
[15] Xiaotie Deng,et al. Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.