Bin-Packing with Fragile Objects

We consider an extension of the classical bin packing problem, motivated by a frequency allocation problem arising in cellular networks. The problem is as follows: Each object has two attributes, weight and fragility. The goal is to pack objects into bins such that, for every bin, the sum of weights of objects in that bin is no more than the fragility of the most fragile object in that bin.

[1]  Roy D. Yates,et al.  A Framework for Uplink Power Control in Cellular Radio Systems , 1995, IEEE J. Sel. Areas Commun..

[2]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[3]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[4]  Jeffrey D. Ullman,et al.  Worst-case analysis of memory allocation algorithms , 1972, STOC.

[5]  P.W. Shor,et al.  The average-case analysis of some on-line algorithms for bin packing , 1984, Comb..

[6]  Jens Zander,et al.  Transmitter Power Control for Co-Channel Interference Management in Cellular Radio Systems - An Overview and some Recent Results , 1993 .

[7]  André van Vliet.  On the Asymptotic Worst Case Behavior of Harmonic Fit , 1996, J. Algorithms.

[8]  Roy D. Yates,et al.  Integrated power control and base station assignment , 1995 .

[9]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[11]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[13]  Edward G. Coffman,et al.  Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[14]  David Tse,et al.  Power control and capacity of spread spectrum wireless networks , 1999, Autom..

[15]  A. Viterbi.  CDMA: Principles of Spread Spectrum Communication , 1995 .

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .