23 citations · 53 across the 26 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Faster algorithm for Unique -CSP
Or Zamir
In a -Constraint Satisfaction Problem we are given a set of arbitrary constraints on pairs of -ary variables, and are asked to find an assignment of values to these varia…
cs.DS2021
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering
Shyam Narayanan, Sandeep Silwal, Piotr Indyk +1
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 loca…