25 citations · 40 across the 13 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018★ 10 cited
Collective fast delivery by energy-efficient agents
Andreas Bärtschi, Daniel Graf, Matus Mihalak
We consider k mobile agents initially located at distinct nodes of an undirected graph (on n nodes, with edge lengths) that have to deliver a single item from a given source node s…
cs.DS2018
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
Annette M. C. Ficker, Thomas Erlebach, Matus Mihalak +1
Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum…