241 citations · 429 across the 7 of their papers we have counts for
9 papers
Accelerating Local Search for the Maximum Independent Set Problem
Jakob Dahlum, Sebastian Lamm, Peter Sanders +3
Computing high-quality independent sets quickly is an important problem in combinatorial optimization. Several recent algorithms have shown that kernelization techniques can be use…
Finding Near-Optimal Independent Sets at Scale
Sebastian Lamm, Peter Sanders, Christian Schulz +2
The independent set problem is NP-hard and particularly difficult to solve in large sparse graphs. In this work, we develop an advanced evolutionary algorithm, which incorporates k…
Public Transit Labeling
Daniel Delling, Julian Dibbelt, Thomas Pajor +1
We study the journey planning problem in public transit networks. Developing efficient preprocessing-based speedup techniques for this problem has been challenging: current approac…
Route Planning in Transportation Networks
Hannah Bast, Daniel Delling, Andrew Goldberg +5
We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less ev…
A Robust and Scalable Algorithm for the Steiner Problem in Graphs
Thomas Pajor, Eduardo Uchoa, Renato F. Werneck
We present an effective heuristic for the Steiner Problem in Graphs. Its main elements are a multistart algorithm coupled with aggressive combination of elite solutions, both lever…
Distance-Based Influence in Networks: Computation and Maximization
Edith Cohen, Daniel Delling, Thomas Pajor +1
A premise at a heart of network analysis is that entities in a network derive utilities from their connections. The {\em influence} of a seed set of nodes is defined as the sum…