论文信息 - Shortest Paths Without a Map - 字舞流文

Shortest Paths Without a Map

Mihalis Yannakakis | Christos H. Papadimitriou | M. Yannakakis | C. Papadimitriou

[1] Ricardo Baeza-Yates,et al. Searching with uncertainty , 1988 .

[2] Lyle A. McGeoch,et al. Competitive algorithms for on-line problems , 1988, STOC '88.

[3] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[5] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.

[6] C. Papadimitriou. Shortest-Path Motion , 1986, FSTTCS.

[7] Christos H. Papadimitriou,et al. An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[8] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.

[9] Christos H. Papadimitriou,et al. Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[11] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..