The linearity of first-fit coloring of interval graphs
SIAM Journal on Discrete Mathematics
A polynomial time approximation algorithm for Dynamic Storage Allocation
Discrete Mathematics
Algorithms for compile-time memory optimization
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms for Dynamic Storage Allocations
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating interval coloring and max-coloring in chordal graphs
Journal of Experimental Algorithmics (JEA)
Traffic-aware dynamic spectrum access
Proceedings of the 4th Annual International Conference on Wireless Internet
About equivalent interval colorings of weighted graphs
Discrete Applied Mathematics
Optimal task allocation on non-volatile memory based hybrid main memory
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Single and multiple device DSA problems, complexities and online algorithms
Theoretical Computer Science
ACM Transactions on Architecture and Code Optimization (TACO)
Approximation algorithms for wavelength assignment
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
DYNAMIC STORAGE ALLOCATION is the problem of packing given axis-aligned rectangles into a horizontal strip of minimum height by sliding the rectangles vertically but not horizontally. Where L=LOAD is the maximum sum of heights of rectangles that intersect any vertical line and OPT is the minimum height of the enclosing strip, it is obvious that OPT≥LOAD; previous work showed that OPT≤ 3• LOAD. We continue the study of the relationship between OPT and LOAD, proving that OPT=L+O((hmax/L)1/7)L, where hmax is the maximum job height. Conversely, we prove that for any ε0, there exists a c0 such that for all sufficiently large integers hmax, there is a DYNAMIC STORAGE ALLOCATION instance with maximum job height hmax, maximum load at most L, and OPT≥ L+c(hmax/L)1/2+εL, for infinitely many integers L. En route, we construct several new polynomial-time approximation algorithms for DYNAMIC STORAGE ALLOCATION.