Sciweavers

JCSS
2007
89views more  JCSS 2007»
14 years 10 days ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
JCO
2006
83views more  JCO 2006»
14 years 12 days ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
SWAT
2004
Springer
136views Algorithms» more  SWAT 2004»
14 years 5 months ago
The Relative Worst Order Ratio Applied to Seat Reservation
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
Joan Boyar, Paul Medvedev