APA (7th ed.) Citation

Ahmadi, A., Gholami, I., Hajiaghayi, M., Jabbarzade, P., & Mahdavi, M. (2025). Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest. 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on, FOCS, 373. https://doi.org/10.1109/FOCS63196.2025.00023

Chicago Style (17th ed.) Citation

Ahmadi, Ali, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, and Mohammad Mahdavi. "Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest." 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on, FOCS 2025: 373. https://doi.org/10.1109/FOCS63196.2025.00023.

MLA (9th ed.) Citation

Ahmadi, Ali, et al. "Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest." 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on, FOCS, 2025, p. 373, https://doi.org/10.1109/FOCS63196.2025.00023.