Author of the publication

Improved Approximations for Unrelated Machine Scheduling.

, and . SODA, page 2917-2946. SIAM, (2023)

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

Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints., , and . J. ACM, 65 (1): 3:1-3:33 (2018)Competitive Analysis of Constrained Queueing Systems., , and . ICALP, volume 55 of LIPIcs, page 143:1-143:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Stochastic Scheduling of Heavy-tailed Jobs., , and . STACS, volume 30 of LIPIcs, page 474-486. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Unconditional Coresets for Regularized Loss Minimization., , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 482-492. PMLR, (2020)Fast Noise Removal for k-Means Clustering., , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 456-466. PMLR, (2020)Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons., and . ECML/PKDD (1), volume 11906 of Lecture Notes in Computer Science, page 173-188. Springer, (2019)New Approximations for Reordering Buffer Management., and . SODA, page 1093-1111. SIAM, (2014)Improved Approximations for Unrelated Machine Scheduling., and . SODA, page 2917-2946. SIAM, (2023)Min-Max Submodular Ranking for Multiple Agents., , , , and . AAAI, page 7061-7068. AAAI Press, (2023)A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints., , , and . APPROX-RANDOM, volume 60 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)