« Back to Record
Citation APA

Bansal, N., Eliáš, M., Jez, L., & Koumoutsos, G. (2017). The (h,k)-Server Problem on Bounded Depth Trees. (pp. 1022-1037) ACM-SIAM Symposium on Discrete Algorithms - SODA(2017).


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/317670

Bansal, N., Eliáš, M., Jez, L., & Koumoutsos, G. (2017). The (h,k)-Server Problem on Bounded Depth Trees. (pp. 1022-1037) ACM-SIAM Symposium on Discrete Algorithms - SODA(2017).