On Lazy Bin Covering and Packing problems

In this paper, we study two interesting variants of the classical bin packing problem, called Lazy Bin Covering (LBC) and Cardinality Constrained Maximum Resource Bin Packing (CCMRBP) problems. For the offline LBC problem, we first prove the approximation ratio of the First-Fit-Decreasing and First-...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science 2010, Vol.411 (1), p.277-284
Hauptverfasser:	Lin, Mingen, Yang, Yang, Xu, Jinhui
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximation algorithms Combinatorics Combinatorics. Ordered structures Computer science control theory systems Designs and configurations Exact sciences and technology Lazy Bin Covering Mathematics Maximum Resource Bin Packing Miscellaneous Sciences and techniques of general use Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!