<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2015-05-29 10:12:12Mathematics Graph theory Routing algorithms Discrete mathematics Edsger W. Dijkstra Network theory Combinatorial optimization Search algorithms Distance oracle A* search algorithm Shortest path problem Link-state routing protocol |
Add to Reading List |
Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] † | Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †DocID: 1qpTV - View Document |
 | A Note on the Nearest Neighbor in Growth-Restricted Metrics Kirsten Hildrum John Kubiatowicz Sean Ma Satish RaoDocID: 1lKEI - View Document |
![6.889 — Lecture 12: Exact Distance Oracles (a.k.a. Shortest-Path Queries) Christian Sommer (figures extracted from [Dji96, FR06]) October 24, 2011 Distance Oracle: given a graph G = (V, E), preprocess it i](https://www.pdfsearch.io/img/3848883b814cd19cda2a2d73dd938848.jpg "6.889 — Lecture 12: Exact Distance Oracles (a.k.a. Shortest-Path Queries) Christian Sommer (figures extracted from [Dji96, FR06]) October 24, 2011 Distance Oracle: given a graph G = (V, E), preprocess it i") | 6.889 — Lecture 12: Exact Distance Oracles (a.k.a. Shortest-Path Queries) Christian Sommer (figures extracted from [Dji96, FR06]) October 24, 2011 Distance Oracle: given a graph G = (V, E), preprocess it iDocID: 1l6lV - View Document |
 | PDF DocumentDocID: 1iRRS - View Document |
 | 6.889 — Lecture 13: Approximate Distance Oracles Christian Sommer October 26, 2011 Approximate Distance Oracle: given a graph G = (V, E), preprocess it into a data structure such that we can compute approxDocID: 1f2gb - View Document |