Fast asymptotic FPTAS for packing fragmentable items with costs

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

Volumn 4639 LNCS, Issue , 2007, Pages 482-493

  Shachnai, Hadas ^a   Yehezkely, Omer ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ASYMPTOTIC ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; TELEVISION NETWORKS; VLSI CIRCUITS;

ASYMPTOTIC FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES (AFPTAS); BIN PACKING WITH SIZE PRESERVING FRAGMENTATION;

ELECTRONICS PACKAGING;

EID: 38149094780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74240-1_42     Document Type: Conference Paper

References (28)

1. Beling, P., Megiddo, N.: Using fast matrix multiplication to find basic solutions. Theoretical Computer Science 205, 307-316 (1993)
2. Coffman Jr, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46-93. PWS Publishing, Boston, MA (1997)
3. Eisenbrand, F.: Fast integer programming in fixed dimension. In: Proc. of ESA (2003)
4. Epstein, L., Levin, A.: A Robust APTAS for the Classical Bin Packing Problem. In: Proc. of ICALP (2006)
5. Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. In: Proc. of ESA (1999)
6. de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1, 349-355 (1981)
7. Fishkin, A.V., Jansen, K., Sevastianov, S., Sitters, R.: Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delay. In: Proc. of ESA (2005)
8. Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM J. on Computing 15, 222-230 (1986)
9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)
10. Grigoriadis, M.D., Khachiyan, L.G., Porkolab, L., Villavicencio, J.: Approximate Max-Min Resource Sharing for Structured Concave Optimization. SIAM J. on Optimization 11(4), 1081-1091 (2000)
11. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197 (1981)
12. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Practical and theoretical results. J. of the ACM 34(1), 144-162 (1987)
13. Jansen, K., Porkolab, L.: On Preemptive Resource Constrained Scheduling: Polynomial-time Approximation Schemes. In: Proc. of IPCO, pp. 329-349 (2002)
14. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one dimensional bin packing problem. In: Proc. of FOCS (1982)
15. Kellerer, H., Pferschy, U.: A New Fully Polynomial Approximation Scheme for the Knapsack Problem. J. of Combinatorial Optimization 3, 59-71 (1999)
16. Mandal, C.A., Chakrabarti, P.P, Ghose, S.: Complexity of fragmentable object bin packing and an application. Computers and Mathematics with Applications 35(11), 91-97 (1998)
17. McNaughton, R.: Scheduling with deadlines and loss functions. Manage. Sci. 6, 1-12 (1959)
18. Menakerman, N., Rom, R.: Bin Packing Problems with Item Fragmentations. In: Proc. of WADS (2001)
19. Motwani, R.: Lecture notes on approximation algorithms. Technical report, Dept. of Computer Science, Stanford Univ., CA (1992)
20. Multimedia Cable Network System Ltd.: Data-Over-Cable Service Interface Specification (2000), http://www.cablelabs.com
21. Murgolo, F.D.: An Efficient Approximation Scheme for Variable-Sized Bin Packing. SIAM J. Comput. 16(1), 149-161 (1987)
22. Naaman, N., Rom, R.: Packet Scheduling with Fragmentation. In: Proc. of INFOCOM'02, pp. 824-831 (2002)
23. Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast Approximation Algorithms for Fractional Packing and Covering Problems. In: Proc. of FOCS (1995)
24. Shachnai, H., Tamir, T., Woeginger, G.J.: Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica 42, 309-334 (2005)
25. Shachnai, H., Tamir, T., Yehezkely, O.: Approximation Schemes for Packing with Item Fragmentation. Theory of Computing Systems (to appear)
26. Shachnai, H., Yehezkely, O.: Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs, full version http://www.cs.technion.ac.il/~hadas/ PUB/frag_afptas.pdf
27. Vazirani, V.V.: Bin Packing. In: Approximation Algorithms, pp. 74-78. Springer, Heidelberg (2001)
28. Young, N.E.: Sequential and Parallel Algorithms for Mixed Packing and Covering. In: Proc. of FOCS, pp. 538-546 (2001)