Pages that link to "Item:Q5321779"
From MaRDI portal
The following pages link to Measuring the problem-relevant information in input (Q5321779):
Displayed 13 items.
- Online bin packing with advice (Q261387) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Weighted Online Problems with Advice (Q2819501) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- On the Power of Randomness versus Advice in Online Computation (Q3166941) (← links)
- Disjoint Path Allocation with Sublinear Advice (Q3196403) (← links)
- Online Bin Packing with Advice of Small Size (Q3449804) (← links)
- Online Multi-Coloring with Advice (Q3453285) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)