activity
20172026
most citedA comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass

11 citations · 15 across the 15 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.DS2024

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths

Matthias Bentert, Leon Kellerhals, Rolf Niedermeier

We study the parameterized complexity of finding shortest s-t-paths with an additional fairness requirement. The task is to compute a shortest path in a vertex-colored graph where…