7 citations · 7 across the 4 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2016
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
Michael Elkin, Ofer Neiman
Miller et al. \cite{MPVX15} devised a distributed\footnote{They actually showed a PRAM algorithm. The distributed algorithm with these properties is implicit in \cite{MPVX15}.} alg…
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…
cs.DS2014
Light Spanners
Michael Elkin, Ofer Neiman, Shay Solomon
A -spanner of a weighted undirected graph , is a subgraph such that for all . The sparseness of the spanner can be measured…