Pages that link to "Item:Q2938097"
From MaRDI portal
The following pages link to On the Power of Advice and Randomization for the Disjoint Path Allocation Problem (Q2938097):
Displaying 17 items.
- Online algorithms with advice: the tape model (Q529045) (← 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)
- Call admission problems on grids with advice (Q2136274) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- Call admission problems on trees (Q2672603) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Advice Complexity of the Online Search Problem (Q2819505) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Advice complexity of disjoint path allocation (Q2953693) (← links)
- Online Graph Coloring Against a Randomized Adversary (Q3177338) (← links)
- Disjoint Path Allocation with Sublinear Advice (Q3196403) (← 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)
- Priority algorithms with advice for disjoint path allocation problems (Q6639746) (← links)
