APA (7th ed.) Citation

Colbourn, C. J. (2024). Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions. SN computer science, 5(2), 247. https://doi.org/10.1007/s42979-023-02548-9

Chicago Style (17th ed.) Citation

Colbourn, Charles J. "Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions." SN Computer Science 5, no. 2 (2024): 247. https://doi.org/10.1007/s42979-023-02548-9.

MLA (9th ed.) Citation

Colbourn, Charles J. "Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions." SN Computer Science, vol. 5, no. 2, 2024, p. 247, https://doi.org/10.1007/s42979-023-02548-9.