Pages that link to "Item:Q496020"
From MaRDI portal
The following pages link to Online algorithms with advice for bin packing and scheduling problems (Q496020):
Displaying 20 items.
- Online bin packing with advice (Q261387) (← links)
- Weighted online problems with advice (Q726104) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Online algorithms with advice for the dual bin packing problem (Q1642809) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Online two-dimensional vector packing with advice (Q2692736) (← links)
- Parallel online algorithms for the bin packing problem (Q2700390) (← links)
- Weighted Online Problems with Advice (Q2819501) (← 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 bin covering with advice (Q5925507) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Parallel solutions for ordinal scheduling with a small number of machines (Q6176402) (← links)
- Priority-based bin packing with subset constraints (Q6184311) (← links)
