Leon Kellerhals

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 2020Show all

2 papers · 1 filter

cs.DS2020

Approximating Sparse Quadratic Programs

Danny Hermelin, Leon Kellerhals, Rolf Niedermeier +1

Given a matrix $A \in R^{n \times n}$ , we consider the problem of maximizing $x^{T} A x$ subject to the constraint $x \in {- 1, 1}^{n}$ . This problem, called MaxQP by Charikar an…

cs.DS2020★ 1 cited

Parameterized Complexity of Geodetic Set

Leon Kellerhals, Tomohiro Koana

A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$ . Given a graph $G$ and $k \in N$ , the NP-hard Geodeti…