mlsanityData to 14 Oct 2026

A note on Probably Certifiably Correct algorithms

arXiv 1509.00824 ↗First posted 2 Sep 2015math.OC cs.DS cs.ITcited by 9

Not on the map. Why?

Abstract (arXiv)

Many optimization problems of interest are known to be intractable, and while there are often heuristics that are known to work on typical instances, it is usually not easy to determine a posteriori whether the optimal solution was found. In this short note, we discuss algorithms that not only solve the problem on typical instances, but also provide a posteriori certificates of optimality, probably certifiably correct (PCC) algorithms. As an illustrative example, we present a fast PCC algorithm for minimum bisection under the stochastic block model and briefly discuss other examples.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Sep 2015.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 4; 2023: 0; 2024: 1.

9 papers.