Funder
Ministerio de Ciencia, Innovación y Universidades
Comunidad de Madrid
Ministry of Education and Science of the Republic of Kazakhstan
Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. Ageev, A.A., Fishkin, A.V., Kononov, A.V., Sevastianov, S.V.: Open block scheduling in optical communication networks. In: International Workshop on Approximation and Online Algorithms, pp. 13–26. Springer, Berlin (2003)
2. Ahuja, N., Baltz, A., Doerr, B., Pívětivý, A., Srivastav, A.: On the minimum load coloring problem. J. Discr. Algor. 5, 533–545 (2007)
3. Barbero, F., Gutin, G., Jones, M., Sheng, B.: Parameterized and approximation algorithms for load coloring problem. Algorithmica 79, 211–229 (2014)
4. Calvo, B., Ceberio, J., Lozano, J. A.: Bayesian inference for algorithm ranking analysis. In Proceedings of the Genetic and Evolutionary Computation Conference Companion GECCO ’18 (pp. 324–325). New York, NY, USA: ACM (2018)
5. Calvo, B., Shir, O. M., Ceberio, J., Doerr, C., Wang, H., Bäck, T., Lozano, J. A.: Bayesian performance analysis for black-box optimization benchmarking. In Proceedings of the Genetic and Evolutionary Computation Conference Companion GECCO ’19 (pp. 1789–1797). New York, NY, USA: ACM (2019)