← Search

Or Zamir

2 accepted papers

2021

Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering

ICML 2021spotlight

Random dimensionality reduction is a versatile tool for speeding up algorithms for high-dimensional problems. We study its application to two clustering problems: the facility location problem, and the single-linkage hierarchical clustering problem, which is equivalent to computing the minimum spann…

Cited by 11SourcePDFScholar
2015

Motion Planning for Unlabeled Discs with Optimality Guarantees

RSS 2015poster

We study the problem of path planning for unlabeled (indistinguishable) unit-disc robots in a planar environment cluttered with polygonal obstacles. We introduce an algorithm which minimizes the total path length, i.e., the sum of lengths of the individual paths. Our algorithm is guaranteed to find…