A performance guarantee for the greedy set-partitioning algorithm

DOI10.1007/BF00264618zbMath0535.05008OpenAlexW1964048951MaRDI QIDQ790814

Michael A. Langston, Edward G. jun. Coffman

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264618

zbMATH Keywords

subsetsset-partitioning

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Elementary theory of partitions (11P81)

Related Items

Comparing the minimum completion times of two longest-first scheduling-heuristics, Improved algorithms to minimize workload balancing criteria on identical parallel machines, A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines, Maximizing the minimum load: the cost of selfishness, The exact LPT-bound for maximizing the minimum completion time, A greedy heuristic for 3-partitioning with similar elements, Heuristic methods and applications: A categorized survey