19 citations · 35 across the 6 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015
Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs
Julian Dibbelt, Ben Strasser, Dorothea Wagner
We study a scenario for route planning in road networks, where the objective to be optimized may change between every shortest path query. Since this invalidates many of the known…
cs.DS2015★ 6 cited
Fast Quasi-Threshold Editing
Ulrik Brandes, Michael Hamann, Ben Strasser +1
We introduce Quasi-Threshold Mover (QTM), an algorithm to solve the quasi-threshold (also called trivially perfect) graph editing problem with edge insertion and deletion. Given a…
cs.DS2015
Graph Bisection with Pareto-Optimization
Michael Hamann, Ben Strasser
We introduce FlowCutter, a novel algorithm to compute a set of edge cuts or node separators that optimize cut size and balance in the Pareto-sense. Our core algorithm solves the ba…