Worst case analysis of two heuristics for the set partitioning problem

DOI10.1051/ITA/1987210100111zbMath0635.68030OpenAlexW160927767MaRDI QIDQ3774940

Antonella Pelaggi, A. Marchetti Spaccamela

Publication date: 1987

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92274

zbMATH Keywords

schedulingset partitioning problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Magic sets revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for combinatorial problems
• Worst-case analysis of the differencing method for the partition problem

This page was built for publication: Worst case analysis of two heuristics for the set partitioning problem