10 citations · 10 across the 2 of their papers we have counts for
3 papers
Efficiently Computing Directed Minimum Spanning Trees
Maximilian Böther, Otto Kißig, Christopher Weyand
Computing a directed minimum spanning tree, called arborescence, is a fundamental algorithmic problem, although not as common as its undirected counterpart. In 1967, Edmonds discus…
What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization
Maximilian Böther, Otto Kißig, Martin Taraz +3
Combinatorial optimization lies at the core of many real-world problems. Especially since the rise of graph neural networks (GNNs), the deep learning community has been developing…
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…