Buchbinder, N., & Feldman, M. (2024). Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2024 IEEE 65th Annual Symposium on, FOCS, 700. https://doi.org/10.1109/FOCS61266.2024.00050
Παραπομπή σε μορφή Chicago (17η εκδ.)Buchbinder, Niv, και Moran Feldman. "Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint." 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2024 IEEE 65th Annual Symposium on, FOCS 2024: 700. https://doi.org/10.1109/FOCS61266.2024.00050.
Παραπομπή σε μορφή MLA (9th εκδ.)Buchbinder, Niv, και Moran Feldman. "Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint." 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), Foundations of Computer Science (FOCS), 2024 IEEE 65th Annual Symposium on, FOCS, 2024, p. 700, https://doi.org/10.1109/FOCS61266.2024.00050.