Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for clustering to minimize the sum of diameters
Nordic Journal of Computing
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Clustering to Minimize the Sum of Diameters
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Compact roundtrip routing in directed networks
Journal of Algorithms
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Sparse source-wise and pair-wise distance preservers
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graph distances in the streaming model: the value of space
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Optimal constrained graph exploration
ACM Transactions on Algorithms (TALG)
Approximate distance oracles for unweighted graphs in expected O(n2) time
ACM Transactions on Algorithms (TALG)
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
Dynamic algorithms for graph spanners
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Roundtrip spanners and roundtrip routing in directed graphs
ACM Transactions on Algorithms (TALG)
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time
Theoretical Computer Science
Faster algorithms for all-pairs small stretch distances in weighted graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Deterministic constructions of approximate distance oracles and spanners
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Small stretch pairwise spanners
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time) for any problem whose solution relies on network decompositions, including small edge cuts in planar graphs, approximate shortest paths, and weight- and distance-preserving graph spanners. In particular, an O(log n) approximation to the k-shortest paths problem on an n-vertex, E-edge graph is obtained that runs in $\soh{n + E + k}$ time.