Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Extremal graphs with no C4,s, or C10,s
Journal of Combinatorial Theory Series B
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Finding the hidden path: time bounds for all-pairs shortest paths
SIAM Journal on Computing
New examples of graphs without small cycles and of large size
European Journal of Combinatorics - Special issue: association schemes
Randomized algorithms
A characterization of the components of the graphs D(k,q)
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Even strongly universal hashing is pretty fast
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Floats, integers, and single source shortest paths
Journal of Algorithms
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Introduction to Algorithms
Lectures on Discrete Geometry
Approximate Distance Oracles Revisited
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximate distance oracles for unweighted graphs in Õ (n2) time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
SIAM Journal on Computing
Proximity-preserving labeling schemes
Journal of Graph Theory
A simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Maintaining information in fully dynamic trees with top trees
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
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Approximate distance oracles for unweighted graphs in expected O(n2) time
ACM Transactions on Algorithms (TALG)
Strong-diameter decompositions of minor free graphs
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On the K-simple shortest paths problem in weighted directed graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Embedding metric spaces in their intrinsic dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Bounded-leg distance and reachability oracles
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Roundtrip spanners and roundtrip routing in directed graphs
ACM Transactions on Algorithms (TALG)
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Polylogarithmic network navigability using compact metrics with small stretch
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distributed algorithms for ultrasparse spanners and linear size skeletons
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time
Theoretical Computer Science
On low dimensional local embeddings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating Shortest Paths in Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
ACM Transactions on Algorithms (TALG)
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Electric Routing and Concurrent Flow Cutting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A sketch-based distance oracle for web-scale graphs
Proceedings of the third ACM international conference on Web search and data mining
Communication algorithms with advice
Journal of Computer and System Sciences
Fast and compact oracles for approximate distances in planar graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
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
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Local computation of nearly additive spanners
DISC'09 Proceedings of the 23rd international conference on Distributed computing
LiveSky: Enhancing CDN with P2P
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Improved multi-criteria spanners for ad-hoc networks under energy and distance metrics
INFOCOM'10 Proceedings of the 29th conference on Information communications
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Additive spanners in nearly quadratic time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
DISC'10 Proceedings of the 24th international conference on Distributed computing
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On the $k$ Shortest Simple Paths Problem in Weighted Directed Graphs
SIAM Journal on Computing
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
SIAM Journal on Computing
Fault Tolerant Spanners for General Graphs
SIAM Journal on Computing
Online computation with advice
Theoretical Computer Science
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Transitive-closure spanners: a survey
Property testing
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Transitive-closure spanners: a survey
Property testing
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
Directed spanners via flow-based linear programs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Electric routing and concurrent flow cutting
Theoretical Computer Science
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Journal of Computer and System Sciences
Improved approximation for the directed spanner problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
VC-dimension and shortest path algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Distance oracles for vertex-labeled graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Querying shortest path distance with bounded errors in large graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Approximate distance queries for weighted polyhedral surfaces
ESA'11 Proceedings of the 19th European conference on Algorithms
ESA'11 Proceedings of the 19th European conference on Algorithms
On approximate distance labels and routing schemes with affine stretch
DISC'11 Proceedings of the 25th international conference on Distributed computing
Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate distance oracles with improved preprocessing time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Journal of Parallel and Distributed Computing
How user behavior is related to social affinity
Proceedings of the fifth ACM international conference on Web search and data mining
Distance labeling in hyperbolic graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Fast, precise and dynamic distance queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximate distance queries in disk graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Node-Disjoint multipath spanners and their relationship with fault-tolerant spanners
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Shortest paths in less than a millisecond
Proceedings of the 2012 ACM workshop on Workshop on online social networks
Fully dynamic randomized algorithms for graph spanners
ACM Transactions on Algorithms (TALG)
Label cover instances with large girth and the hardness of approximating basic k-spanner
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Preserving terminal distances using minors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Approximate shortest paths guided by a small index
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Dynamic covering for recommendation systems
Proceedings of the 21st ACM international conference on Information and knowledge management
Improved distance oracles and spanners for vertex-labeled graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fault-tolerant compact routing schemes for general graphs
Information and Computation
Approximation algorithms for spanner problems and Directed Steiner Forest
Information and Computation
Fault tolerant additive spanners
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Multipath spanners via fault-tolerant spanners
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Efficient distributed source detection with limited bandwidth
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: a simple stretch 2 distance oracle
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Fast routing table construction using small messages: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
Label constrained shortest path estimation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Small stretch pairwise spanners
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
Hi-index | 0.01 |
Let G = (V,E) be an undirected weighted graph with |V| = n and |E| = m. Let k ≥ 1 be an integer. We show that G = (V,E) can be preprocessed in O(kmn1/k) expected time, constructing a data structure of size O(kn1+1/k), such that any subsequent distance query can be answered, approximately, in O(k) time. The approximate distance returned is of stretch at most 2k−1, that is, the quotient obtained by dividing the estimated distance by the actual distance lies between 1 and 2k−1. A 1963 girth conjecture of Erdós, implies that Ω(n1+1/k) space is needed in the worst case for any real stretch strictly smaller than 2k+1. The space requirement of our algorithm is, therefore, essentially optimal. The most impressive feature of our data structure is its constant query time, hence the name "oracle". Previously, data structures that used only O(n1+1/k) space had a query time of Ω(n1/k).Our algorithms are extremely simple and easy to implement efficiently. They also provide faster constructions of sparse spanners of weighted graphs, and improved tree covers and distance labelings of weighted or unweighted graphs.