Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut.

Sevag Gharibian Ojas Parekh

Published in: CoRR (2019)

Keyphrases

approximation algorithms
worst case
np hard
max cut
minimum cost
constant factor
special case
optimal solution
dynamic programming
approximation ratio
primal dual
greedy heuristic
graph model
undirected graph
planar graphs