Approximation schemes for packing splittable items with cardinality constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4927 LNCS, Issue , 2008, Pages 232-245

  Epstein, Leah ^a   Van Stee, Rob ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; BINS; POLYNOMIALS;

APPROXIMATION SCHEMES; BIN-PACKING; CARDINALITY CONSTRAINTS; ON-LINE ALGORITHMS; OPTIMAL NUMBER; POLYNOMIAL-TIME; POLYNOMIAL-TIME APPROXIMATION SCHEME; SPLITTABLE;

POLYNOMIAL APPROXIMATION;

EID: 49949113179     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77918-6_19     Document Type: Conference Paper

References (15)

1. Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Applied Mathematics 143(1-3), 238-251 (2004)
2. Caprara, A., Kellerer, H., Pferschy, U.: Approximation schemes for ordered vector packing problems. Naval Research Logistics 92, 58-69 (2003)
3. Chung, F., Graham, R., Mao, J., Varghese, G.: Parallelism versus memory allocation in pipelined router forwarding engines. Theory of Computing Systems 39(6), 829-849 (2006)
4. de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1+epsilon in linear time. Combinatorica 1(4), 349-355 (1981)
5. Epstein, L.: Online bin packing with cardinality constraints. SIAM Journal on Discrete Mathematics 20(4), 1015-1030 (2006)
6. Epstein, L., van Stee, R.: Improved results for a memory allocation problem. In: WADS 2007. Workshop on Algorithms and Data Structures, pp. 362-373 (2007)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
8. Graham, R.L., Mao, J.: Parallel resource allocation of splittable items with cardinality constraints (manuscript)
9. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM 34(1), 144-162 (1987)
10. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 312-320 (1982)
11. Kellerer, H., Pferschy, U.: Cardinality constrained bin-packing problems. Annals of Operations Research 92, 335-348 (1999)
12. Krause, K.L., Shen, V.Y., Schwetman, H.D.: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM 22(4), 522-550 (1975)
13. Krause, K.L., Shen, V.Y., Schwetman, H.D.: Errata: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM 24(3), 527-527 (1977)
14. Shachnai, H., Tamir, T., Yehezkely, O.: Approximation schemes for packing with item fragmentation. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 334-347. Springer, Heidelberg (2006)
15. Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics 41(4), 579-585 (1994)