Author:
Cygan Marek,Jeż Łukasz,Sgall Jiří
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference17 articles.
1. Azar, Y., Boyar, J., Epstein, L., Favrholdt, L.M., Larsen, K.S., Nielsen, M.N.: Fair versus unrestricted bin packing. Algorithmica 34(2), 181–196 (2002)
2. Azar, Y., Khaitsin, E.: Prompt mechanism for ad placement over time (2011)
3. Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in online algorithms. Algorithmica, 11(1):2–14, 1994. Also appeared in. Proc. of the 22nd ACM Symp. on Theory of Comput. (STOC), 379–386 (1990)
4. Böckenhauer, H.-J., Komm, D., Královic, R., Rossmanith, P.: On the advice complexity of the knapsack problem (2012)
5. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献