Funder
Google Research Latin America
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software
Reference63 articles.
1. Barba, L., Cardinal, J., Korman, M., Langerman, S., Van Renssen, A., Roeloffzen, M., Verdonschot, S.: Dynamic graph coloring. In: Workshop on Algorithms and Data Structures, pp. 97–108. Springer (2017). https://doi.org/10.1109/CCCA.2011.6031437
2. Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities—an $$O(n^{1/4})$$ approximation for densest $$k$$-Subgraph. In: 42nd ACM Symposium on Theory of Computing, p. 201. ACM Press, New York, NY, USA (2010). https://doi.org/10.1145/1806689.1806719
3. Blöchliger, I., Zufferey, N.: A reactive tabu search using partial solutions for the graph coloring problem. Tech. Rep. 04/03, École PolyTechnique Fédérale de Lausanne (2004)
4. Blöchliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Comput. Oper. Res. 35(3), 960–975 (2008). https://doi.org/10.1016/j.cor.2006.05.014
5. Bourgeois, N., Giannakos, A., Lucarelli, G., Milis, I., Paschos, V.T.: Exact and superpolynomial approximation algorithms for the densest $$k$$-subgraph problem. Eur. J. Oper. Res. 262(3), 894–903 (2017). https://doi.org/10.1016/j.ejor.2017.04.034