Vickrey prices and shortest paths: What is an edge worth? In Proceedings 42nd IEEE symposium on foundations of computer science , pages 252--259

John Hershberger, Subhash Suri · 2001

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.DS · 2024-02-20 · unverdicted · novelty 6.0

An f-fault tolerant distance oracle with space O(f^4 n^2 log^2 (nW)) and query time O((c f log (nW))^{O(f^2)}) for graphs with integral edge weights.

Showing 1 of 1 citing paper.

Nearly Optimal Fault Tolerant Distance Oracle cs.DS · 2024-02-20 · unverdicted · none · ref 27
An f-fault tolerant distance oracle with space O(f^4 n^2 log^2 (nW)) and query time O((c f log (nW))^{O(f^2)}) for graphs with integral edge weights.