3 papers
cs.DS2020
Approximating Sparse Quadratic Programs
Danny Hermelin, Leon Kellerhals, Rolf Niedermeier +1
Given a matrix , we consider the problem of maximizing subject to the constraint . This problem, called MaxQP by Charikar an…
cs.DS2020
Parameterized Complexity of Geodetic Set
Leon Kellerhals, Tomohiro Koana
A vertex set of a graph is geodetic if every vertex of lies on a shortest path between two vertices in . Given a graph and , the NP-hard Geodeti…
cs.DS2018
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
Matthias Bentert, Alexander Dittmann, Leon Kellerhals +2
Betweenness centrality---measuring how many shortest paths pass through a vertex---is one of the most important network analysis concepts for assessing the relative importance of a…