7 citations · 8 across the 12 of their papers we have counts for
3 papers · 1 filter
Realistic Runtime Analysis for Quantum Simplex Computation
Sabrina Ammann, Maximilian Hess, Debora Ramacciotti +10
In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic wors…
A quantum algorithm for solving 0-1 Knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +3
Here we present two novel contributions for achieving quantum advantage in solving difficult optimisation problems, both in theory and foreseeable practice. (1) We introduce the "Q…
The Lawn Mowing Problem: From Algebra to Algorithms
Sándor P. Fekete, Dominik Krupke, Michael Perk +2
For a given polygonal region , the Lawn Mowing Problem (LMP) asks for a shortest tour that gets within Euclidean distance 1/2 of every point in ; this is equivalent to co…