23 citations · 146 across the 41 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 1 cited
Metric Perturbation Resilience
Konstantin Makarychev, Yury Makarychev
We study the notion of perturbation resilience introduced by Bilu and Linial (2010) and Awasthi, Blum, and Sheffet (2012). A clustering problem is -perturbation resilient if the…
cs.DS2016
Robust algorithms with polynomial loss for near-unanimity CSPs
Víctor Dalmau, Marcin Kozik, Andrei Krokhin +3
An instance of the Constraint Satisfaction Problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a fixed domain…