2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2011★ 2 cited
Minimum Weight Cycles and Triangles: Equivalences and Algorithms
Liam Roditty, Virginia Vassilevska Williams
We consider the fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph. In particular, we show that the minimum weight cycle problem in an undirec…
cs.DS2010
Fast, precise and dynamic distance queries
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz +2
We present an approximate distance oracle for a point set S with n points and doubling dimension λ. For every ε>0, the oracle supports (1+ε)-approximate distance queries in (univer…