Pages that link to "Item:Q2914354"
From MaRDI portal
The following pages link to Online Coloring of Bipartite Graphs with and without Advice (Q2914354):
Displaying 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 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)
- On the advice complexity of the online dominating set problem (Q1998864) (← 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)
- 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)
- Fully Online Matching with Advice on General Bipartite Graphs and Paths (Q6163625) (← links)