( en | de | ru )

 

Disambiguation of "Feldman, Moran"

Author of the publication

copydeleteadd this publication to your clipboard
Maximizing Symmetric Submodular Functions.

. ACM Trans. Algorithms, 13 (3): 39:1-39:36 (2017)

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.

Jon Feldman

Diana Westfalia Morán Puente

Aleksandar Feldman

Max Feldman

Külliki Feldman

 

Other publications of authors with the same name

A Framework for the Secretary Problem on the Intersection of Matroids., , and . CoRR, (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)Deterministic Algorithms for Submodular Maximization Problems., and . CoRR, (2015)Frequency capping in online advertising., , , and . J. Sched., 17 (4): 385-398 (2014)Non-preemptive buffer management for latency sensitive packets., and . J. Sched., 20 (4): 337-353 (2017)Hedonic Clustering Games., , and . ACM Trans. Parallel Comput., 2 (1): 4:1-4:48 (2015)Online Submodular Maximization with Preemption., , and . ACM Trans. Algorithms, 15 (3): 30:1-30:31 (2019)Hierarchical Task Assignment and Communication Algorithms for Unmanned Aerial Vehicle Flocks., , , and . J. Aerosp. Comput. Inf. Commun., 5 (8): 234-250 (2008)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)Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets., and . CoRR, (2022)