Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest $k$-Subgraph Problem

Omkar Bihani, Roman Kužel, Janez Povh +1

In this paper, we introduce three QUBO (Quadratic Unconstrained Binary Optimization) relaxations for the sparsest $k$-subgraph (SkS) problem: a quadratic penalty relaxation, a Lagr…