Author of the publication

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics.

, , , , and . MFCS, volume 170 of LIPIcs, page 18:1-18:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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 Graph Exploration: New Results on Old and New Algorithms., , and . ICALP (2), volume 6756 of Lecture Notes in Computer Science, page 478-489. Springer, (2011)Approximation in Preemptive Stochastic Online Scheduling., and . ESA, volume 4168 of Lecture Notes in Computer Science, page 516-527. Springer, (2006)New Results on Online Resource Minimization., , and . CoRR, (2014)Stochastic Online Scheduling on Parallel Machines., , and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 167-180. Springer, (2004)Optimally handling commitment issues in online throughput maximization., , and . CoRR, (2019)A general framework for handling commitment in online throughput maximization., , , , and . Math. Program., 183 (1): 215-247 (2020)A Universal Error Measure for Input Predictions Applied to Online Graph Problems., , , , , and . NeurIPS, (2022)Optimally Handling Commitment Issues in Online Throughput Maximization., , and . ESA, volume 173 of LIPIcs, page 41:1-41:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Online Minimum Cost Matching with Recourse on the Line., and . APPROX-RANDOM, volume 176 of LIPIcs, page 37:1-37:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Algorithms and complexity for periodic real-time scheduling., , , and . ACM Trans. Algorithms, 9 (1): 6:1-6:19 (2012)