Pages that link to "Item:Q1693995"
From MaRDI portal
The following pages link to The advice complexity of a class of hard online problems (Q1693995):
Displayed 13 items.
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- Weighted online problems with advice (Q726104) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Labeling schemes for deterministic radio multi-broadcast (Q2672450) (← links)
- Call admission problems on trees (Q2672603) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Online Metric Algorithms with Untrusted Predictions (Q6075754) (← links)
- Online minimum spanning trees with weight predictions (Q6179406) (← links)
- Online interval scheduling with predictions (Q6179410) (← links)
- Advice complexity bounds for online delayed \(\mathcal{F} \)-node-, \(H\)-node- and \(H\)-edge-deletion problems (Q6182892) (← links)
- Online knapsack with removal and recourse (Q6182898) (← links)