𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximizing the minimum load for selfish agents

✍ Scribed by Leah Epstein; Rob van Stee

Book ID
108281583
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
820 KB
Volume
411
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

ΞΊ-Partitioning problems for maximizing t
ΞΊ-Partitioning problems for maximizing the minimum load
✍ Yong He; Zhiyi Tan; Jing Zhu; Enyu Yao πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 664 KB

The optimization versions of the k-PARTITIONING problems are considered in this paper. For the objective to maximize the minimum load of m subsets, we first show that the FOLD-ING algorithm has a tight worst case ratio of max{2/k, l/m}. Th en, we present an algorithm called HARMONIC1 with a worst ca