Author of the publication

Approximating Robust Bin Packing with Budgeted Uncertainty.

, , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 71-84. Springer, (2019)

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 the d-Runaway Rectangle Escape Problem., , , and . CCCG, Carleton University, Ottawa, Canada, (2014)On Range Summary Queries., , , and . ICALP, volume 261 of LIPIcs, page 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing., , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 25-37. Springer, (2017)Local search strikes again: PTAS for variants of geometric covering and packing., , and . J. Comb. Optim., 39 (2): 618-635 (2020)The Runaway Rectangle Escape Problem., , , , , and . CoRR, (2016)Effectiveness of Local Search for Art Gallery Problems., and . WADS, volume 10389 of Lecture Notes in Computer Science, page 49-60. Springer, (2017)Demand Hitting and Covering of Intervals., , , and . CALDAM, volume 10156 of Lecture Notes in Computer Science, page 267-280. Springer, (2017)Packing and Covering with Non-Piercing Regions., , , and . Discret. Comput. Geom., 60 (2): 471-492 (2018)Approximating Robust Bin Packing with Budgeted Uncertainty., , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 71-84. Springer, (2019)