Allocation of bandwidth and storage

References

• Arkin , E.M. and Silverberg , E. B. ( 1987 ) Scheduling jobs with fixed start and end times. Discrete Applied Muthematics. , 18 . 1 – 8 .
   Web of Science ®Google Scholar
• Bar-Ney , A. , Cancui , R. , Kutten . S. , Mansour , Y. and Schieber , B. (1999) Bandwidth allocation with preemption. SIAM Journal of Computing , 28 . 1806 – 1828 .
   Web of Science ®Google Scholar
• Bar-Noy , A. , Bar-Ychuda . B. , Freund , A. , Naor , J. and Schieber , B. ( 2000 ) A unified approach to approximating resource allocation and scheduling , in Proceedings of the 32nd Annual ACM Symposium on the Theory of Compnting , (to appear in Journal of ACM).
   Google Scholar
• Chandra , A.K. , Hirschberg , D.S. and Wong , C.K. ( 1976 ) Approximation algorithms for some generalised knapsack problems. Theoretical Computer Science. , 3 , 293 – 304 .
   Google Scholar
• Coffman , Jr. , E.G. ( 1983 ) An introduction to combinatorial models of dynamic storage allocation. SIAM Review , 25 , 311 – 325 .
   Web of Science ®Google Scholar
• Corneujols , G. , Fisher , M.L. and Ncmhauscr , G.L. ( 1977 ) Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Science , 23 , 789 – 810 .
   Web of Science ®Google Scholar
• Frieze , A.M. and Clarke , M.R.B. ( 1984 ) Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses. European Journal of Operational Research. , 15 . 100 – 109 .
   Web of Science ®Google Scholar
• Garey , M.R. and Johnson , D.S. ( 1979 ) Computers and IIItractability: A Guide to the Theory of NP-Completeness , Freeman. San Francisco .
   Google Scholar
• Gergov , J. ( 1999 ) Algorithms for compile-time memory optimization, in Proceedings of the Huh Annual ACM-SIAM Symposium On Discrete Algorithms. , ACM. New York . pp. 907 – 908 .
   Google Scholar
• Harms , J.J. and Wong , J.W. ( 1995 ) Performance modeling of a channel reservation service. Computer Networks and ISDN Systems. , 27 . 1487 – 1497 .
   Web of Science ®Google Scholar
• Nemhauser , G. and Wolsey , L.A. ( 1988 ) Integer and Combinatorial Optimization , Wiley. New York .
   Google Scholar
• Papadirnitriou , C.H. and Steiglitz , K. ( 1982 ) Combinatorial Optimization: Algorithms and Complexity. , Prentice-Hall. Englewood Cliffs . NJ .
   Google Scholar
• Phillips , C. , Uma , R.N. and Wein , J. (2000) Off-line admission control for general scheduling problems. in Proceedings ofthe llth Annual ACM-SIAM Symposium on Discrete Algorithms. , ACM. New York . pp. 879 – 888 .
   Google Scholar
• Robson , J.M. ( 1974 ) Bounds for some functions concerning dynamic storage allocation. Journal of Association for Computing Machinery. , 21 . 491 – 499 .
   Web of Science ®Google Scholar
• Szlusarck , M. ( 1987 a) An off-line storage allocation algorithm. Informotion Processing Letters , 24 . 71 – 75 .
   Web of Science ®Google Scholar
• Slusarck , M. ( 1987 b) NP-eompleteness of storage allocation. Jagiellonian University Scientific Papers: Informatics , 3 , 7 – 18 .
   Google Scholar