7 citations · 8 across the 12 of their papers we have counts for
6 papers · 1 filter
Efficient Heuristics and Exact Methods for Pairwise Interaction Sampling
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke +1
We consider a class of optimization problems that are fundamental to testing in modern configurable software systems, e.g., in automotive industries. In pairwise interaction sampli…
Beyond asymptotic scaling: Comparing functional quantum linear solvers
Andreea-Iulia Lefterovici, Michael Perk, Debora Ramacciotti +3
Solving systems of linear equations is a key subroutine in many quantum algorithms. In the last 15 years, many quantum linear solvers (QLS) have been developed, competing to achiev…
A quantum search method for quadratic and multidimensional knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +5
Solving combinatorial optimization problems is a promising application area for quantum algorithms in real-world scenarios. In this work, we extend the "Quantum Tree Generator" (QT…
Exact Algorithms for Minimum Dilation Triangulation
Sándor P. Fekete, Phillip Keldenich, Michael Perk
We provide a spectrum of new theoretical insights and practical results for finding a Minimum Dilation Triangulation (MDT), a natural geometric optimization problem of considerable…
Multi-Covering a Point Set by Disks with Minimum Total Area
Mariem Guitouni, Chek-Manh Loi, Sándor P. Fekete +2
A common robotics sensing problem is to place sensors to robustly monitor a set of assets, where robustness is assured by requiring asset to be monitored by at least sen…
How Low Can We Go? Minimizing Interaction Samples for Configurable Systems
Dominik Krupke, Ahmad Moradi, Michael Perk +5
Modern software systems are typically configurable, a fundamental prerequisite for wide applicability and reusability. This flexibility poses an extraordinary challenge for quality…