๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Maximizing the minimum load: The cost of selfishness

โœ Scribed by Chen, Xujin; Epstein, Leah; Kleiman, Elena; van Stee, Rob


Book ID
123385934
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
365 KB
Volume
482
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


ฮบ-Partitioning problems for maximizing t
โœ 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

The communication cost of selfishness
โœ Ronald Fadel; Ilya Segal ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB
Minimum-cost loading of transformers
โœ Klopfenstein, Arthur ๐Ÿ“‚ Article ๐Ÿ“… 1956 ๐Ÿ› Institute of Electrical and Electronics Engineers โš– 398 KB