A succinct and approximate greedy algorithm for the Minimum Set Cover Problem.

MLA

Delgado, Jorge, et al. “A Succinct and Approximate Greedy Algorithm for the Minimum Set Cover Problem.” Journal of Computational Science, vol. 81, Sept. 2024, p. N.PAG. EBSCOhost, https://doi.org/10.1016/j.jocs.2024.102378.

APA

Delgado, J., Ferrada, H., & Navarro, C. A. (2024). A succinct and approximate greedy algorithm for the Minimum Set Cover Problem. Journal of Computational Science, 81, N.PAG. https://doi.org/10.1016/j.jocs.2024.102378

Chicago

Delgado, Jorge, Héctor Ferrada, and Cristóbal A. Navarro. 2024. “A Succinct and Approximate Greedy Algorithm for the Minimum Set Cover Problem.” Journal of Computational Science 81 (September): N.PAG. doi:10.1016/j.jocs.2024.102378.