7 citations · 16 across the 30 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Hop-Constrained Metric Embeddings and their Applications
Arnold Filtser
In network design problems, such as compact routing, the goal is to route packets between nodes using the (approximated) shortest paths. A desirable property of these routes is a s…
cs.DS2021
Locality-Sensitive Orderings and Applications to Reliable Spanners
Arnold Filtser, Hung Le
Chan, Har-Peled, and Jones [2020] recently developed locality-sensitive ordering (LSO), a new tool that allows one to reduce problems in the Euclidean space to the $…
cs.DS2021★ 2 cited
Clan Embeddings into Trees, and Low Treewidth Graphs
Arnold Filtser, Hung Le
In low distortion metric embeddings, the goal is to embed a host "hard" metric space into a "simpler" target space while approximately preserving pairwise distances. A highly desir…