( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.

, , , , , , , и . IPCO, том 7801 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2013)

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.

Jon Feldman

Diana Westfalia Morán Puente

Aleksandar Feldman

Max Feldman

Külliki Feldman

 

Другие публикации лиц с тем же именем

Non-preemptive buffer management for latency sensitive packets., и . J. Sched., 20 (4): 337-353 (2017)Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?, , и . ICML, том 80 из Proceedings of Machine Learning Research, стр. 803-812. PMLR, (2018)Hierarchical Task Assignment and Communication Algorithms for Unmanned Aerial Vehicle Flocks., , , и . J. Aerosp. Comput. Inf. Commun., 5 (8): 234-250 (2008)Improved approximating algorithms for Directed Steiner Forest., , и . SODA, стр. 922-931. SIAM, (2009)Building a Good Team: Secretary Problems and the Supermodular Degree., и . SODA, стр. 1651-1670. SIAM, (2017)A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem., , и . SODA, стр. 1189-1201. SIAM, (2015)Online Submodular Maximization with Preemption., , и . SODA, стр. 1202-1216. SIAM, (2015)Deterministic Algorithms for Submodular Maximization Problems., и . SODA, стр. 392-403. SIAM, (2016)A Framework for the Secretary Problem on the Intersection of Matroids., , и . CoRR, (2017)Ad-Hoc Routing Using Virtual Coordinates Based on Rooted Trees., , и . SUTC (1), стр. 6-13. IEEE Computer Society, (2006)