Author of the publication

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract).

, , and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 342-353. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Framework for the Secretary Problem on the Intersection of Matroids., , and . CoRR, (2017)Non-preemptive buffer management for latency sensitive packets., and . J. Sched., 20 (4): 337-353 (2017)Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?, , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 803-812. PMLR, (2018)Hierarchical Task Assignment and Communication Algorithms for Unmanned Aerial Vehicle Flocks., , , and . J. Aerosp. Comput. Inf. Commun., 5 (8): 234-250 (2008)Deterministic Algorithms for Submodular Maximization Problems., and . SODA, page 392-403. SIAM, (2016)Building a Good Team: Secretary Problems and the Supermodular Degree., and . SODA, page 1651-1670. SIAM, (2017)Improved approximating algorithms for Directed Steiner Forest., , and . SODA, page 922-931. SIAM, (2009)A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem., , and . SODA, page 1189-1201. SIAM, (2015)Online Submodular Maximization with Preemption., , and . SODA, page 1202-1216. SIAM, (2015)Streaming Submodular Maximization Under Matroid Constraints., , , , and . ICALP, volume 229 of LIPIcs, page 59:1-59:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)