Pages that link to "Item:Q1884771"
From MaRDI portal
The following pages link to The power of priority algorithms for facility location and set cover (Q1884771):
Displayed 9 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Limitations of incremental dynamic programming (Q517805) (← 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)
- Advice complexity of priority algorithms (Q5916086) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)