A Classical Algorithm Which Also Beats $\frac{1}{2}+\frac{2}{\pi}\frac{1}{\sqrt{D}}$ For High Girth MAX-CUT
Matthew B. Hastings

TL;DR
This paper presents a straightforward classical algorithm, based on a modification of the Gaussian wave process, that surpasses a specific performance bound for high girth MAX-CUT problems.
Contribution
It introduces a simple, provably effective classical algorithm that improves upon existing bounds for high girth MAX-CUT.
Findings
Achieves performance better than 1/2 + (2/π)(1/√D) for high girth MAX-CUT.
Uses a simple modification of the Gaussian wave process.
Provides a provable performance guarantee.
Abstract
We give a simple classical algorithm which provably achieves the performance in the title. The algorithm is a simple modification of the Gaussian wave process.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Surface Polishing Techniques · Integrated Circuits and Semiconductor Failure Analysis · Advancements in Semiconductor Devices and Circuit Design
