A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs (1993)

by Philip N. Klein , Sairam Subramanian
Citations:20 - 2 self

Documents Related by Co-Citation

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
402 A Separator Theorem for Planar Graphs – Richard J. Lipton, Robert E. Tarjan - 1977
68 Incremental Algorithms for Minimal Length Paths – G Ausiello, G Italiano, Marchetti Spaccamela, A, U Nanni - 1991
728 Heuristics: Intelligent Search Strategies for Computer Problem Solving – J Pearl - 1984
1259 Graph Theory – F Harary - 1969
2901 Dynamic programming – R E Bellman - 1957
792 Introduction to Algorithms, Second Edition – T H Leiserson, C E Cormen, R L Rivest, C Stein - 2001
891 A note on two problems in connection with graphs – E W Dijkstra - 1959
1547 Network Flows: Theory, Algorithms, and Applications – R K Ahuja, T L Magnanti, J B Orlin - 1993