Login / Signup

The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover.

Jeremy CookStephan J. EidenbenzAndreas Bärtschi
Published in: QCE (2020)
Keyphrases
  • vertex cover
  • approximation algorithms
  • partial order
  • precedence constraints
  • planar graphs
  • special case
  • worst case
  • branch and bound algorithm
  • polynomial time approximation