Buchbinder, N., & Feldman, M. (2024, October 27). Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. Proceedings / annual Symposium on Foundations of Computer Science, 700-712. https://doi.org/10.1109/FOCS61266.2024.00050
Citace podle Chicago (17th ed.)Buchbinder, Niv, a Moran Feldman. "Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint." Proceedings / Annual Symposium on Foundations of Computer Science 27 Oct. 2024: 700-712. https://doi.org/10.1109/FOCS61266.2024.00050.
Citace podle MLA (9th ed.)Buchbinder, Niv, a Moran Feldman. "Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint." Proceedings / Annual Symposium on Foundations of Computer Science, 27 Oct. 2024, pp. 700-712, https://doi.org/10.1109/FOCS61266.2024.00050.