Approximation lower bounds in online LIB bin packing and covering
Approximation lower bounds in online LIB bin packing and covering
- University of South Australia Australia
bin packing problem, bin covering problem, uniform sized bins, online approximation algorithm, asymptotic worst case ratio, longest item
bin packing problem, bin covering problem, uniform sized bins, online approximation algorithm, asymptotic worst case ratio, longest item
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 0
Average
Average
Average
Fields of Science (4) View all
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?