Author:
Im Sungjin,Moseley Benjamin
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aboud, A.: Correlation clustering with penalties and approximating the reordering buffer management problem. Masters thesis, Computer Science Department, The Technion - Israel Institute of Technology (2008)
2. Adamaszek, A., Czumaj, A., Englert, M., Räcke, H.: Almost tight bounds for reordering buffer management. In: STOC, pp. 607–616 (2011)
3. Alborzi, H., Torng, E., Uthaisombut, P., Wagner, S.: The k-client problem. J. Algorithms 41(2), 115–173 (2001)
4. Asahiro, Y., Kawahara, K., Miyano, E.: Np-hardness of the sorting buffer problem on the uniform metric. Discrete Applied Mathematics 160(10–11), 1453–1464 (2012)
5. Avigdor-Elgrabli, N., Im, S., Moseley, B., Rabani, Y.: On the randomized competitive ratio of reordering buffer management with non-uniform costs. Manuscript (2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Almost Tight Bounds for Reordering Buffer Management;SIAM Journal on Computing;2022-05-24
2. Polylogarithmic Guarantees for Generalized Reordering Buffer Management;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11