Work

An explicit vector algorithm for high-girth MaxCut

Year: 2022

Type: conference-paper

Abstract: We give an approximation algorithm for MaxCut and provide guarantees on the average fraction of edges cut on d-regular graphs of girth ≥ 2k. For every d ≥ 3 and k ≥ 4, our approximation guarantees are better than those of all other classical and quantum algorithms known to the authors. Our algorithm constructs an explicit vector solution to the standard semidefinite relaxation of MaxCut and applies hyperplane rounding. It may be viewed as a simplification of the previously best known technique, which approximates Gaussian wave processes on the infinite d-regular tree.

Source: Society for Industrial and Applied Mathematics eBooks

DOI: 10.1137/1.9781611977066.17

Authors: Jessica K. Thompson, Ojas Parekh, Kunal Marwaha

Institutions: University of Maryland, College Park, Sandia National Laboratories, University of California, Berkeley

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green