Parametric Packing of Selfish Items and the Subset Sum Algorithm

The subset sum algorithm is a natural heuristic for the classical Bin Packing problem: In each iteration, the algorithm finds among the unpacked items, a maximum size set of items that fits into a new bin. More than 35 years after its first mention in the literature, establishing the worst-case perf...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 74; H. 1; S. 177 - 207
Hauptverfasser:	Epstein, Leah, Kleiman, Elena, Mestre, Julián
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.01.2016
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Algorithm theory Bin packing Approximation algorithms Game theory Price of anarchy
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!