- Tytuł:
- Canonical greedy algorithms and dynamic programming
- Autorzy:
- Lew, A.
- Powiązania:
- https://bibliotekanauki.pl/articles/970856.pdf
- Data publikacji:
- 2006
- Wydawca:
- Polska Akademia Nauk. Instytut Badań Systemowych PAN
- Tematy:
-
programowanie dynamiczne
Dijkstra
greedy algorithm
dynamic programming - Opis:
- There has been little work on how to construct greedy algorithms to solve new optimization problems efficiently. Instead, greedy algorithms have generally been designed on an ad hoc basis. On the other hand, dynamic programming has a long history of being a useful tool for solving optimization problems, but is often inefficient. We show how dynamic programming can be used to derive efficient greedy algorithms that are optimal for a wide variety of problems. This approach also provides a way to obtain less efficient but optimal solutions to problems where derived greedy algorithms are nonoptimal.
- Źródło:
-
Control and Cybernetics; 2006, 35, 3; 621-643
0324-8569 - Pojawia się w:
- Control and Cybernetics
- Dostawca treści:
- Biblioteka Nauki
Artykuł