The authors introduce subadditive load balancing, prove an approximation bound for a modularization-minimization algorithm, give a lower-bound method, and test the approach on multi-robot routing.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Subadditive Load Balancing
The authors introduce subadditive load balancing, prove an approximation bound for a modularization-minimization algorithm, give a lower-bound method, and test the approach on multi-robot routing.