Publisher
Springer Nature Switzerland
Reference18 articles.
1. Clementi, A.E.F., Ianni, M.D.: On the hardness of approximating optimum schedule problems in store and forward networks. IEEE/ACM Trans. Network. 4(2), 272–280 (1996)
2. Graham, D.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, A Foundation for Computer Science, 2nd edn. Addison-Wesley, Boston (1994)
3. Harks, T., Peis, B., Schmand, D., Tauer, B., Koch, L.V.: Competitive packet routing with priority lists. ACM Trans. Econ. Comput. (TEAC) (2018)
4. Kleinberg, J., va Tardos: Algorithm Design. Pearson, New York (2006)
5. Korte, B., Vygen, J.: Combinatorial Optimization, Theory and Algorithms. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-662-56039-6