The following pages link to Online bin packing with advice (Q2965482):
Displaying 15 items.
- Online bin packing with advice (Q261387) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- On the list update problem with advice (Q515679) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- Online rules for container stacking (Q989634) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- Online Bin Packing with Advice of Small Size (Q3449804) (← links)
- Online Multi-Coloring with Advice (Q3453285) (← links)
- (Q4886075) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← links)
- Online bin covering with advice (Q5925507) (← links)