Sciweavers

84 search results - page 1 / 17
» Schemes for SR-Tree packing
Sort
View
96
Voted
IPL
2008
132views more  IPL 2008»
14 years 10 months ago
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
Leah Epstein, Asaf Levin
CN
2006
124views more  CN 2006»
14 years 10 months ago
A cost-effective approach to selective IP paging scheme using explicit multicast
Sangheon Pack, Kyoungae Kim, Yanghee Choi
107
Voted
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 10 months ago
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
Richard Beigel, Bin Fu
IPCO
2008
129views Optimization» more  IPCO 2008»
14 years 11 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
125
Voted
MOR
2006
123views more  MOR 2006»
14 years 10 months ago
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
Nikhil Bansal, José R. Correa, Claire Kenyo...