4 citations · 8 across the 12 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Matching with Multiple Bottlenecks: Parameterized Complexity and Approximation
Jonas Friemel, Tilo Hoitz, Phillip Keldenich +1
We consider a matching problem in which the cost of each edge is a vector with components. The cost of a matching is the sum of the bottlenecks over all components, and we ask…
cs.RO2026
Pass the Bucket: Efficient, Robust, Local Load Balancing for Teams of Heterogeneous Robots
Tobias Wallner, Dominik Krupke, Arne Schmidt +1
We study the problem of decentralized, self-organized task sharing for a swarm of heterogeneous robots that collaborate in transportation or other objectives that require coordinat…