On Epsilon-Nets, Distance Oracles, and Metric Embeddings
Abstract
We give two new applications of an observation from ADFGW11. The first is an almost linear sized constant time data structure for reporting very large distances in undirected graphs. The second is a generic transformation of results about 1-embeddability of metrics to a setting, where we are interested in preservation of large distances only.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.