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):
Displaying 17 items.
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Weighted online problems with advice (Q726104) (← links)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- Labeling schemes for deterministic radio multi-broadcast (Q2672450) (← links)
- Call admission problems on trees (Q2672603) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Weighted Online Problems with Advice (Q2819501) (← links)
- Advice complexity of disjoint path allocation (Q2953693) (← links)
- Advice complexity for a class of online problems (Q2954988) (← links)
- On the Advice Complexity of Online Problems (Q3652221) (← 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)
- On the Advice Complexity of Online Edge- and Node-Deletion Problems (Q6163644) (← links)