39 citations · 89 across the 25 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 1 cited
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances
Václav Rozhoň, Bernhard Haeupler, Anders Martinsson +2
We introduce stronger notions for approximate single-source shortest-path distances, show how to efficiently compute them from weaker standard notions, and demonstrate the algorith…
cs.DS2018
Optimal strategies for patrolling fences
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson +2
A classical multi-agent fence patrolling problem asks: What is the maximum length of a line that agents with maximum speeds can patrol if each point on the…