Local approximation of the Maximum Cut in regular graphs.
Étienne BamasLouis EsperetPublished in: CoRR (2019)
Keyphrases
- integrality gap
- approximation algorithms
- linear programming relaxation
- closed form
- approximation error
- graph matching
- weighted graph
- lower bound
- linear programming
- graph mining
- graph theory
- absolute error
- maximum error
- approximation guarantees
- small world
- spanning tree
- graph structure
- neural network
- bipartite graph
- error bounds
- markov random field
- special case
- search algorithm
- objective function