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

Documenti analoghi

• Quantum computing and the stable set problem
  di: Krpan, Aljaž, et al.
  Pubblicazione: (2024)
• Practical Experience with Stable Set and Coloring Relaxations
  di: Pucher, Dunja, et al.
  Pubblicazione: (2024)
• Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
  di: Vodeb, Jaka, et al.
  Pubblicazione: (2024)
• An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
  di: Mohammadisiahroudi, Mohammadhossein, et al.
  Pubblicazione: (2023)
• The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
  di: Gaar, Elisabeth, et al.
  Pubblicazione: (2024)