𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bin packing: Maximizing the number of pieces packed

✍ Scribed by E. G. Coffman; J. Y. -T. Leung; D. W. Ting

Publisher
Springer-Verlag
Year
1978
Tongue
English
Weight
450 KB
Volume
9
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The k-piece packing problem
The k-piece packing problem
✍ David Hartvigsen; Pavol Hell; JΓ‘cint SzabΓ³ πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 278 KB

## Abstract A __k__‐piece of a graph __G__ is a connected subgraph of __G__ all of whose nodes have degree at most __k__ and at least one node has degree equal to __k__. We consider the problem of covering the maximum number of nodes of a graph by node disjoint __k__‐pieces. When __k__ = 1 this is