Are Stable Instances Easy?

@article{Bilu2009AreSI,
  title={Are Stable Instances Easy?},
  author={Yonatan Bilu and Nathan Linial},
  journal={Comb. Probab. Comput.},
  year={2009},
  volume={21},
  pages={643-660}
}
  • Yonatan Bilu, Nathan Linial
  • Published in Comb. Probab. Comput. 2009
  • Computer Science, Mathematics
  • We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP-hard problems are easier to solve, and in particular, whether there exist algorithms that solve in polynomial time all sufficiently stable instances of some NP-hard problem. The paper focuses on the Max-Cut problem, for which we show that this is indeed the case. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 88 CITATIONS

    Perturbations , Optimization , and Statistics

    VIEW 8 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    1 Bilu – Linial Stability

    VIEW 8 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings

    VIEW 8 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Algorithms for stable and perturbation-resilient problems

    VIEW 9 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Alpha-expansion is Exact on Stable Instances

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Clustering under Local Stability: Bridging the Gap between Worst-Case and Beyond Worst-Case Analysis

    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    On the Local Structure of Stable Clustering Instances

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Optimality of Approximate Inference Algorithms on Stable Instances

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Stability and Recovery for Independence Systems

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    FILTER CITATIONS BY YEAR

    2009
    2020

    CITATION STATISTICS

    • 25 Highly Influenced Citations

    • Averaged 13 Citations per year from 2017 through 2019

    • 8% Increase in citations per year in 2019 over 2018

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 16 REFERENCES

    Eigenvalues and graph bisection: An average-case analysis

    • Ravi B. Boppana
    • Mathematics, Computer Science
    • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
    • 1987
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method

    • Roman Vershynin
    • Mathematics, Computer Science
    • 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
    • 2006
    VIEW 1 EXCERPT

    Heuristics for Semirandom Graph Problems

    VIEW 1 EXCERPT

    Spectral partitioning of random graphs

    • Frank McSherry
    • Computer Science
    • Proceedings 2001 IEEE International Conference on Cluster Computing
    • 2001
    VIEW 1 EXCERPT

    The Metropolis Algorithm for Graph Bisection

    VIEW 1 EXCERPT

    Computational complexity

    VIEW 1 EXCERPT