<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-06-06 03:08:31Network theory Routing algorithms Edsger W. Dijkstra Graph theory Shortest path problem Distance oracle Routing Flow network Contraction hierarchies K shortest path routing |
 | Distributed Computing manuscript No. (will be inserted by the editor) Joan Feigenbaum · Rahul Sami · Scott Shenker Mechanism Design for Policy RoutingDocID: 1oZA5 - View Document |
| PDF DocumentDocID: 1iRRS - View Document |
 | A Comparison of High-Level Approaches for Speeding Up Pathfinding Nathan R. Sturtevant1 Robert Geisberger Department of Computing ScienceDocID: V3lu - View Document |
 | UntitledDocID: jbG - View Document |