Minimum Vertex Cover

The 'Minimum Vertex Cover' is a benchmark dataset used to evaluate algorithms in the context of Quadratic Unconstrained Binary Optimization (QUBO) problems, specifically focusing on finding the smallest set of vertices that covers all edges in a graph.

Papers using Minimum Vertex Cover (2)

Separating Ansatz Discovery from Deployment on Larger Problems: Reinforcement Learning for Modular Circuit Design2025Reinforcement Learning for Variational Quantum Circuits Design2024 · 1 cites