1 citations · 1 across the 4 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Efficiently Computing Maximum Flows in Scale-Free Networks
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
We study the maximum-flow/minimum-cut problem on scale-free networks, i.e., graphs whose degree distribution follows a power-law. We propose a simple algorithm that capitalizes on…
cs.DS2020
A Strategic Routing Framework and Algorithms for Computing Alternative Paths
Thomas Bläsius, Maximilian Böther, Philipp Fischbeck +9
Traditional navigation services find the fastest route for a single driver. Though always using the fastest route seems desirable for every individual, selfish behavior can have un…