𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bin packing games

✍ Scribed by Jeroen Kuipers

Book ID
105114338
Publisher
Springer
Year
1998
Tongue
English
Weight
617 KB
Volume
47
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Selfish Bin Packing
Selfish Bin Packing
✍ Leah Epstein; Elena Kleiman πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 842 KB
Batched bin packing
Batched bin packing
✍ Gregory Gutin; Tommy Jensen; Anders Yeo πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 196 KB
Complexity of core allocation for the bi
Complexity of core allocation for the bin packing game
✍ Zhixin Liu πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 853 KB

This paper provides complexity results and develops optimal algorithms for core membership and emptiness tests of the bin packing game. Our algorithms find the maximum surplus profit, the least integer core value, and the minimum value required by the grand coalition for the existence of an integer

Random-order bin packing
Random-order bin packing
✍ Edward G. Coffman Jr.; JΓ‘nos Csirik; Lajos RΓ³nyai; Ambrus ZsbΓ‘n πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 253 KB
Approximation Algorithms || Bin Packing
Approximation Algorithms || Bin Packing
✍ Vazirani, Vijay V. πŸ“‚ Article πŸ“… 2003 πŸ› Springer Berlin Heidelberg 🌐 English βš– 598 KB

Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conΒ­ jecture that P -=/= NP, their