Pages that link to "Item:Q2890195"
From MaRDI portal
The following pages link to Advice Complexity of Online Coloring for Paths (Q2890195):
Displayed 16 items.
- Online bin packing with advice (Q261387) (← links)
- Online coloring of bipartite graphs with and without advice (Q486981) (← 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 string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← 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 Graph Coloring Against a Randomized Adversary (Q3177338) (← links)
- Online Multi-Coloring with Advice (Q3453285) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)
- Online \(L(2,1)\)-coloring problem on paths with restricted size of memory (Q6043925) (← links)
- Fully Online Matching with Advice on General Bipartite Graphs and Paths (Q6163625) (← links)