A Classical Algorithm Which Also Beats 1/2+2/π1/√(D) For High Girth MAX-CUT

11/24/2021
by   Matthew B. Hastings, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2022

The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut

We investigate the space complexity of two graph streaming problems: Max...
research
01/03/2022

A New Modeling of Classical Folds in Computational Origami

This paper shows a cut along a crease on an origami sheet makes simple m...
research
03/15/2018

Approximating Max-Cut under Graph-MSO Constraints

We consider the max-cut and max-k-cut problems under graph-based constra...
research
06/18/2022

Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm

In this note, we describe a α_GW + Ω̃(1/d^2)-factor approximation algori...
research
08/04/2022

Domination and Cut Problems on Chordal Graphs with Bounded Leafage

The leafage of a chordal graph G is the minimum integer l such that G ca...
research
06/16/2022

An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms

We resolve the approximability of the maximum energy of the Quantum Max ...
research
05/24/2023

Replicable Reinforcement Learning

The replicability crisis in the social, behavioral, and data sciences ha...

Please sign up or login with your details

Forgot password? Click here to reset