Author of the publication

Covering Clients with Types and Budgets.

, , , and . ISAAC, volume 123 of LIPIcs, page 73:1-73:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

Online Non-Monotone DR-Submodular Maximization., and . AAAI, page 9868-9876. AAAI Press, (2021)Covering Clients with Types and Budgets., , , and . ISAAC, volume 123 of LIPIcs, page 73:1-73:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Online Non-Monotone DR-submodular Maximization., and . CoRR, (2019)Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines., , , , and . FSTTCS, volume 150 of LIPIcs, page 24:1-24:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality., , , and . ESA, volume 57 of LIPIcs, page 63:1-63:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Online Non-preemptive Scheduling on Unrelated Machines with Rejections., , , , and . SPAA, page 291-300. ACM, (2018)Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines., , , , and . ESA, volume 112 of LIPIcs, page 59:1-59:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees., , , and . CoRR, (2019)A stochastic conditional gradient algorithm for decentralized online convex optimization., , , and . J. Parallel Distributed Comput., (2022)Online Non-preemptive Scheduling on Unrelated Machines with Rejections., , , , and . ACM Trans. Parallel Comput., 8 (2): 9:1-9:22 (2021)