scientific article; zbMATH DE number 910900
From MaRDI portal
Publication:4886075
zbMath0849.68088MaRDI QIDQ4886075
Publication date: 4 November 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Online Bin Packing with Advice of Small Size ⋮ Semi-on-line bin packing: a short overview and a new lower bound ⋮ Ignorant vs. Anonymous Recommendations ⋮ The dynamic frequency assignment problem ⋮ Online algorithms with advice for the dual bin packing problem ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ A competitive analysis of the list update problem with lookahead ⋮ Online packet scheduling with bounded delay and lookahead ⋮ Tight bounds for NF-based bounded-space online bin packing algorithms ⋮ On-line bin packing with restricted repacking ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ Lower bound for 3-batched bin packing ⋮ Resource augmented semi-online bounded space bin packing ⋮ Online computation with advice ⋮ Batched bin packing ⋮ On competitive recommendations ⋮ Exact distributional analysis of online algorithms with lookahead ⋮ Improved lower bounds for semi-online bin packing problems ⋮ Online bin covering with advice ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead ⋮ Semi on-line algorithms for the partition problem ⋮ On competitive on-line paging with lookahead ⋮ Online bin packing with advice of small size ⋮ Online bin packing with advice
This page was built for publication:
