Pages that link to "Item:Q4924664"
From MaRDI portal
The following pages link to Advice Complexity of the Online Coloring Problem (Q4924664):
Displaying 14 items.
- Online bin packing with advice (Q261387) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- On the list update problem with advice (Q515679) (← links)
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← 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)
- On Energy-Efficient Computations With Advice (Q3196431) (← links)
- Online Multi-Coloring with Advice (Q3453285) (← links)
- Towards using the history in online computation with advice (Q5501863) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)
- Online \(L(2,1)\)-coloring problem on paths with restricted size of memory (Q6043925) (← links)
