𝔖 Bobbio Scriptorium
✦   LIBER   ✦

3-Partitioning Problems for Maximizing the Minimum Load

✍ Scribed by Shi Ping Chen; Yong He; Guohui Lin

Book ID
110321427
Publisher
Springer US
Year
2002
Tongue
English
Weight
101 KB
Volume
6
Category
Article
ISSN
1382-6905

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

Algorithms for the minimum partitioning
Algorithms for the minimum partitioning problems in graphs
✍ Hiroshi Nagamochi πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen