Author of the publication

Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs.

, and . SOSA, page 82-96. SIAM, (2024)

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

On Orthogonal Symmetric Chain Decompositions., , , and . Electron. J. Comb., 26 (3): 3 (2019)Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs., and . CoRR, (2023)Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling., , , and . CoRR, (2022)Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling., , , and . IPCO, volume 13904 of Lecture Notes in Computer Science, page 246-260. Springer, (2023)Gray Codes and Symmetric Chains., , , , and . ICALP, volume 107 of LIPIcs, page 66:1-66:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling., and . STACS, volume 96 of LIPIcs, page 43:1-43:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Gray codes and symmetric chains., , , , and . J. Comb. Theory, Ser. B, (2022)On orthogonal symmetric chain decompositions., , , and . CoRR, (2018)The blockwise coordinate descent method for integer programs., and . Math. Methods Oper. Res., 91 (2): 357-381 (2020)Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates.. Oper. Res. Lett., 46 (5): 505-509 (2018)