| Dynamic Programming: All-Points Shortest-Path Problem |
college |
| topic: |
CS577 (Algorithms) |
|
Dynamic programming finds optimal solutions to problems by recursively figuring out
which sub-solution, combined with the choices at the current level, will produce
the best result |
| formats: |
Adobe PDF (45.7kB), PostScript (31.6kB), TeX (3.7kB)
|
1997-04-28 |
quality 4 |
|
Back to list of documents
|