Bilu-Linial stability

MaRDI QIDQ3295547zbMATH OpenFDO

Authors Konstantin Makarychev, Yury Makarychev

Publication date 10 July 2020

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Algorithms for stable and perturbation-resilient problems
• Center-based clustering under perturbation stability
• Data stability in clustering: a closer look
• Bilu-Linial stable instances of max cut and minimum multiway cut

Cited in

(1)

• Perturbation Resilience

This page was built for publication: Bilu-Linial stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3295547)