Algorithms for stable and perturbation-resilient problems

  title={Algorithms for stable and perturbation-resilient problems},
  author={Haris Angelidakis and K. Makarychev and Yury Makarychev},
  journal={Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing},
We study the notion of stability and perturbation resilience introduced by Bilu and Linial (2010) and Awasthi, Blum, and Sheffet (2012). A combinatorial optimization problem is α-stable or α-perturbation-resilient if the optimal solution does not change when we perturb all parameters of the problem by a factor of at most α. In this paper, we give improved algorithms for stable instances of various clustering and combinatorial optimization problems. We also prove several hardness results. We… Expand
k-center Clustering under Perturbation Resilience
Clustering Perturbation Resilient Instances
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
On the Local Structure of Stable Clustering Instances
Bilu-Linial stability, certified algorithms and the Independent Set problem
Clustering Stable Instances of Euclidean k-means


Clustering under Perturbation Resilience
Center-based clustering under perturbation stability
On the Complexity of the Metric TSP under Stability Considerations
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
Linear degree extractors and the inapproximability of max clique and chromatic number
Robust algorithms for restricted domains
Are Stable Instances Easy?
An improved approximation algorithm for multiway cut
k-Center Clustering Under Perturbation Resilience