Local approximation of the Maximum Cut in regular graphs.
Étienne BamasLouis EsperetPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- integrality gap
- planar graphs
- approximation algorithms
- linear programming relaxation
- graph matching
- approximation guarantees
- lower bound
- approximation error
- closed form
- error bounds
- graph theory
- graph model
- special case
- arbitrarily close
- absolute error
- series parallel
- approximation methods
- spanning tree
- graph databases
- graph clustering
- graph representation
- graph partitioning
- bipartite graph