Current studentsExisting staffContact us
 

Approximation lower bounds in online LIB bin packing and covering

Simple item page
dc.contributor.authorManyem, P.
dc.contributor.authorSalt, R.L.
dc.contributor.authorVisser, M.
dc.date.issued2003
dc.identifier.citationJournal of Automata, Languages and Combinatorics, 2003
dc.identifier.issn1430-189X
dc.identifier.urihttps://hdl.handle.net/1959.8/87921
dc.language.isoen
dc.publisherOtto-von-Guericke-Universitat
dc.rightsCopyright status unknown
dc.subjectonline approximation algorithm
dc.subjectasymptotic worst case ratio
dc.subjectbin packing problem
dc.subjectbin covering problem
dc.subjectlongest item
dc.subjectuniform sized bins
dc.titleApproximation lower bounds in online LIB bin packing and covering
dc.typeJournal article
pubs.publication-statusPublished
ror.mmsid9915913237701831

Files

Collections