( en | de | ru )

 

Disambiguation of "Feldman, Moran"

Author of the publication

copydeleteadd this publication to your clipboard
Building a Good Team: Secretary Problems and the Supermodular Degree.

, and . SODA, page 1651-1670. SIAM, (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

Regularized Submodular Maximization at Scale., , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 5356-5366. PMLR, (2021)Online Submodular Maximization: Beating 1/2 Made Simple., , , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 101-114. Springer, (2019)Hierarchical Task Assignment and Communication Algorithms for Unmanned Aerial Vehicle Flocks., , , and . J. Aerosp. Comput. Inf. Commun., 5 (8): 234-250 (2008)Non-preemptive buffer management for latency sensitive packets., and . J. Sched., 20 (4): 337-353 (2017)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)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)Online Submodular Maximization with Preemption., , and . SODA, page 1202-1216. SIAM, (2015)A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem., , and . SODA, page 1189-1201. SIAM, (2015)