Author of the publication

The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences.

, , , and . Nord. J. Comput., 8 (4): 463-472 (2001)

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

The relative worst order ratio applied to paging., , and . SODA, page 718-727. SIAM, (2005)Fair versus Unrestricted Bin Packing., , , , , and . Algorithmica, 34 (2): 181-196 (2002)Relaxing the Irrevocability Requirement for Online Graph Algorithms., , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 217-228. Springer, (2017)Extending the Accommodating Function., , , and . COCOON, volume 2387 of Lecture Notes in Computer Science, page 87-96. Springer, (2002)The Relative Worst Order Ratio for On-Line Algorithms., and . CIAC, volume 2653 of Lecture Notes in Computer Science, page 58-69. Springer, (2003)Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem., , , , , , , and . J. Sched., 6 (2): 131-147 (2003)Online bin covering: Expectations vs. guarantees., , and . Theor. Comput. Sci., (2014)Online multi-coloring with advice., , and . Theor. Comput. Sci., (2015)The relative worst-order ratio applied to paging., , and . J. Comput. Syst. Sci., 73 (5): 818-843 (2007)The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences., , , and . Nord. J. Comput., 8 (4): 463-472 (2001)