SIGN IN
SIGN UP
The relative worst order ratio for online algorithms
Full Text:
Pdf
Buy this Article
Authors:
Joan Boyar
University of Southern Denmark, Odense M, Denmark
Lene M. Favrholdt
University of Southern Denmark, Odense M, Denmark
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 3 Issue 2, May 2007
Article No. 22
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1240233.1240245
2007 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 43
· Downloads (cumulative): 473
· Citation Count: 11
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
bin packing
dual bin packing
online
quality measure
relative worst order ratio
sequencing and scheduling
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder