2000 character limit reached
On Epsilon-Nets, Distance Oracles, and Metric Embeddings
Published 19 Jun 2012 in cs.DS, math.CO, and math.MG | (1206.4164v1)
Abstract: We give two new applications of an observation from \cite{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 $\ell_1$-embeddability of metrics to a setting, where we are interested in preservation of large distances only.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
