On the absolute approximation ratio for First Fit and related results
暂无分享,去创建一个
Leah Epstein | Joan Boyar | György Dósa | J. Boyar | L. Epstein | G. Dósa
[1] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[2] Binzhou Xia,et al. Tighter bounds of the First Fit algorithm for the bin-packing problem , 2010, Discret. Appl. Math..
[3] Joan Boyar,et al. The Relative Worst Order Ratio for On-Line Algorithms , 2003, CIAC.
[4] Jeffrey D. Ullman,et al. The performance of a memory allocation algorithm , 1971 .
[5] Alejandro López-Ortiz,et al. On the Separation and Equivalence of Paging Strategies and Other Online Algorithms , 2018, Algorithmica.
[6] Andrew Chi-Chih Yao,et al. Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.
[7] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..
[8] Joan Boyar,et al. The relative worst order ratio for online algorithms , 2007, TALG.
[9] Leah Epstein,et al. Tight results for Next Fit and Worst Fit with resource augmentation , 2010, Theor. Comput. Sci..
[10] D. Simchi-Levi. New worst‐case results for the bin‐packing problem , 1994 .
[11] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[12] Sandy Irani,et al. A Comparison of Performance Measures for Online Algorithms , 2009, WADS.
[13] Pascal Schweitzer,et al. Paging and list update under bijective analysis , 2009, JACM.