A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Improved routing strategies with succinct tables
Journal of Algorithms
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
A Graph-Theoretic Game and its Application to the $k$-Server Problem
SIAM Journal on Computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact routing with minimum stretch
Journal of Algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
SIAM Journal on Computing
An improved approximation algorithm for the 0-extension problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A note on the nearest neighbor in growth-restricted metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On coresets for k-means and k-median clustering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithms for dynamic geometric problems over data streams
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Proximity-preserving labeling schemes
Journal of Graph Theory
Fast construction of nets in low dimensional metrics, and their applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Small hop-diameter sparse spanners for doubling metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The black-box complexity of nearest-neighbor search
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimal-stretch name-independent compact routing in doubling metrics
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
Probabilistic embeddings of bounded genus graphs into planar graphs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On triangulation of simple networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Compact routing with slack in low doubling dimension
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
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Ultra-low-dimensional embeddings for doubling metrics
Proceedings of the nineteenth 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
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Metric clustering via consistent labeling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Hierarchical routing over dynamic wireless networks
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dynamic routing and location services in metrics of low doubling dimension
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
Shifting Strategy for Geometric Graphs without Geometry
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
How to complete a doubling metric
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Genus and the geometry of the cut graph
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Proximity algorithms for nearly-doubling spaces
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A Lower Bound for Network Navigability
SIAM Journal on Discrete Mathematics
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
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Distributed spanner construction in doubling metric spaces
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Distance labeling in hyperbolic graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Localized and compact data-structure for comparability graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation schemes for node-weighted geometric steiner tree problems
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Fast, precise and dynamic distance queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximate nearest neighbor search for low dimensional queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distributed transactional memory for metric-space networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
A QPTAS for ε-envy-free profit-maximizing pricing on line graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of radius r. This concept for abstract metrics has been proposed as a natural analog to the dimension of a Euclidean space. If we could embed metrics with low doubling dimension into low dimensional Euclidean spaces, they would inherit several algorithmic and structural properties of the Euclidean spaces. Unfortunately however, such a restriction on dimension does not suffice to guarantee embeddibility in a normed space.In this paper we explore the option of bypassing the embedding. In particular we show the following for low dimensional metrics: Quasi-polynomial time (1+ε)-approximation algorithm for various optimization problems such as TSP, k-median and facility location. (1+ε)-approximate distance labeling scheme with optimal label length. (1+ε)-stretch polylogarithmic storage routing scheme.