✦ LIBER ✦

Minimum-Cost Load-Balancing Partitions

✍ Scribed by Boris Aronov; Paz Carmi; Matthew J. Katz

Book ID: 106148856
Publisher: Springer
Year: 2007
Tongue: English
Weight: 469 KB
Volume: 54
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9125-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum cost partitions of a rectangle

✍ Michelle L. Wachs 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 794 KB

Minimum-cost loading of transformers

✍ Klopfenstein, Arthur 📂 Article 📅 1956 🏛 Institute of Electrical and Electronics Engineers ⚖ 398 KB

Minimum Cost Partitions of Trees with Su

Minimum Cost Partitions of Trees with Supply and Demand

✍ Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 666 KB

Partitioning of unstructured meshes for

Partitioning of unstructured meshes for load balancing

✍ Martin, Olivier C. ;Otto, Steve W. 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 714 KB

3-Partitioning Problems for Maximizing t

3-Partitioning Problems for Maximizing the Minimum Load

✍ Shi Ping Chen; Yong He; Guohui Lin 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 101 KB

κ-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