7 citations · 7 across the 1 of their papers we have counts for
2 papers
cs.DS2023
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
Costas Busch, Da Qi Chen, Arnold Filtser +3
A spanning tree of graph is a -approximate universal Steiner tree (UST) for root vertex if, for any subset of vertices containing , the cost of the minimal su…
cs.DS2015★ 7 cited
Prioritized Metric Structures and Embedding
Michael Elkin, Arnold Filtser, Ofer Neiman
Metric data structures (distance oracles, distance labeling schemes, routing schemes) and low-distortion embeddings provide a powerful algorithmic methodology, which has been succe…