Pages that link to "Item:Q2894454"
From MaRDI portal
The following pages link to On the Advice Complexity of the Knapsack Problem (Q2894454):
Displaying 14 items.
- Online knapsack revisited (Q260271) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- Online coloring of bipartite graphs with and without advice (Q486981) (← 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)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← 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)
- Treasure Hunt with Advice (Q3460725) (← links)
- Towards using the history in online computation with advice (Q5501863) (← links)
