Bounded-space online bin cover
作者： Eyjolfur Ingi Asgeirsson , Cliff Stein , None
DOI: 10.1007/S10951-009-0116-X
关键词:
摘要: … Abstract In this paper, we look at the online bounded-space bin … analyze the problem. We will use the insights given by the Markov chains to design an algorithm for the online bounded-…
springer.com
sci-hub.se 
researchgate.net 参考文章(15)
Janos Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber, A Self Organizing Bin Packing Heuristic algorithm engineering and experimentation. pp. 246- 265 ,(1999) , 10.1007/3-540-48518-X_15
Sheldon M. Ross, Introduction to Probability Models, Eighth Edition ,(1972)
Janos Csirik, Claire Kenyon, David S. Johnson, Better approximation algorithms for bin covering symposium on discrete algorithms. pp. 557- 566 ,(2001) , 10.5555/365411.365533
J. Csirik, V. Totik, Online algorithms for a dual version of bin packing Discrete Applied Mathematics. ,vol. 21, pp. 163- 167 ,(1988) , 10.1016/0166-218X(88)90052-2
E. G. Coffman, D. S. Johnson, P. W. Shor, R. R. Weber, Markov chains, computer proofs, and average-case analysis of best fit bin packing Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93. pp. 412- 421 ,(1993) , 10.1145/167088.167203
S.F Assmann, D.S Johnson, D.J Kleitman, J.Y.-T Leung, On a dual version of the one-dimensional bin packing problem Journal of Algorithms. ,vol. 5, pp. 502- 525 ,(1984) , 10.1016/0196-6774(84)90004-X
Janos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber, On the sum-of-squares algorithm for bin packing symposium on the theory of computing. pp. 208- 217 ,(2000) , 10.1145/335305.335331
E. G. Coffman, C. Courcoubetis, M. R. Garey, D. S. Johnson, P. W. Shor, R. R. Weber, M. Yannakakis, Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing SIAM Review. ,vol. 44, pp. 95- 108 ,(2002) , 10.1137/S0036144501395423
Narendra Karmarkar, Richard M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). pp. 312- 320 ,(1982) , 10.1109/SFCS.1982.61
Coastas Courcobetis, Richard Weber, STABILITY OF ON-LINE BIN PACKING WITH RANDOM ARRIVALS AND LONG-RUN-AVERAGE CONSTRAINTS Probability in the Engineering and Informational Sciences. ,vol. 4, pp. 447- 460 ,(1990) , 10.1017/S0269964800001753