Filmus, Y., & Ward, J. (2012, October). A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint. 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 659-668. https://doi.org/10.1109/FOCS.2012.55
Citace podle Chicago (17th ed.)Filmus, Y., a J. Ward. "A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint." 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science Oct. 2012: 659-668. https://doi.org/10.1109/FOCS.2012.55.
Citace podle MLA (9th ed.)Filmus, Y., a J. Ward. "A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint." 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, Oct. 2012, pp. 659-668, https://doi.org/10.1109/FOCS.2012.55.