Pages that link to "Item:Q5713429"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5713429):
Displayed 8 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)