Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint
Συγγραφείς: Buchbinder, Niv, Feldman, Moran
Πηγή: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2024 IEEE 65th Annual Symposium on. :700-712 Oct, 2024
Relation: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)
Βάση Δεδομένων: IEEE Xplore Digital Library
Περιγραφή
ISBN:9798331516741
ISSN:25758454
DOI:10.1109/FOCS61266.2024.00050