pdf-format: |
|
@InProceedings{ene_et_al:LIPIcs:2019:10630, author = {Alina Ene and Huy L. Nguyen}, title = {{Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {54:1--54:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10630}, URN = {urn:nbn:de:0030-drops-106303}, doi = {10.4230/LIPIcs.ICALP.2019.54}, annote = {Keywords: submodular maximization, matroid constraints, fast running times} }
Keywords: | submodular maximization, matroid constraints, fast running times | |
Seminar: | 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) | |
Issue date: | 2019 | |
Date of publication: | 04.07.2019 |