Approximate Distance Oracles (2001)

by Mikkel Thorup , Uri Zwick
Citations:207 - 8 self

Active Bibliography

57 Exact and Approximate Distances in Graphs - a survey – Uri Zwick - 2001
43 Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs – Yuri Rabinovich, Ran Raz - 1996
6 Additive Spanners and (α, β)-Spanners – Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
23 Approximating minimum max-stretch spanning trees on unweighted graphs – Yuval Emek, David Peleg - 2004
188 Expander Graphs and their Applications – Nati Linial, Avi Wigderson - 2003
36 All-Pairs Small-Stretch Paths – Edith Cohen, Uri Zwick - 1997
Algorithms and Models for Problems in Networking – Michael Dinitz - 2010
16 Low Distortion Spanners – Seth Pettie
Additive Spanners for Circle Graphs and Polygonal Graphs ⋆ – Feodor F. Dragan, Derek G. Corneil, Yang Xiang
65 Bypassing the embedding: Algorithms for low-dimensional metrics – Kunal Talwar - 2004
323 Probabilistic Approximation of Metric Spaces and its Algorithmic Applications – Yair Bartal - 1996
7 Fault-tolerant spanners: Better and simpler – Michael Dinitz, Robert Krauthgamer - 2011
Discrete & Computational Geometry © 1998 Springer-Verlag New York Inc. Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs – Y. Rabinovich, R. Raz
The Art of Metric Embeddings — A technique oriented approach – Zhang Qin - 2007
4 Computing the greedy spanner in near-quadratic time – Prosenjit Bose , Paz Carmi , Mohammad Farshi , Anil Maheshwari , Michiel Smid - 2008
3 Approximation Algorithms for Network Design: A Survey – Anupam Gupta, Jochen Könemann
39 Balancing Minimum Spanning Trees and Shortest-Path Trees – Samir Khuller, Balaji Raghavachari, Neal Young - 2002
20 Randomised Techniques in Combinatorial Algorithmics – Michele A. A. Zito - 1999
83 All Pairs Almost Shortest Paths – Dorit Dor, Shay Halperin, Uri Zwick - 1996