activity
20222025
most citedQuantum computing and the stable set problem

2 citations · 2 across the 6 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

math.OC2025

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest -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 -subgraph (SkS) problem: a quadratic penalty relaxation, a Lagr…