Author of the publication

How to Pack Your Items When You Have to Buy Your Knapsack.

, , , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 62-73. 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. 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

Splitting versus setup trade-offs for scheduling to minimize weighted completion time., , and . Oper. Res. Lett., 44 (4): 469-473 (2016)A Local-Search Algorithm for Steiner Forest., , , , , , and . ITCS, volume 94 of LIPIcs, page 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Dual Techniques for Scheduling on a Machine with Varying Speed., and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 745-756. Springer, (2013)A QPTAS for the General Scheduling Problem with Identical Release Dates., , , , and . ICALP, volume 80 of LIPIcs, page 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)The Power of Recourse for Online MST and TSP., , , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 689-700. Springer, (2012)The Online Set Aggregation Problem., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 245-259. Springer, (2018)Min-Sum Scheduling Under Precedence Constraints., and . ESA, volume 57 of LIPIcs, page 74:1-74:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Closing the Gap for Makespan Scheduling via Sparsification Techniques., , and . ICALP, volume 55 of LIPIcs, page 72:1-72:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Scheduling periodic tasks in a hard real-time environment., , , , , and . Scheduling, volume 10071 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)On the configuration-LP for scheduling on unrelated machines., and . J. Scheduling, 17 (4): 371-383 (2014)