Login / Signup

An Improved Quantum Max Cut Approximation via Maximum Matching.

Eunou LeeOjas Parekh
Published in: ICALP (2024)
Keyphrases
  • max cut
  • maximum matching
  • bipartite graph
  • graph model
  • planar graphs
  • stable set
  • np hard
  • graph partitioning
  • np complete problems
  • closed form
  • approximation algorithms
  • spectral graph
  • min max
  • search space
  • random walk