Elements of dynamic and 2-SAT programming : : paths, trees, and cuts / / Matthias Bentert.
This thesis presents faster (in terms of worst-case running times) exact algorithms for special cases of graph problems through dynamic programming and 2-SAT programming. Dynamic programming describes the procedure of breaking down a problem recursively into overlapping subproblems, that is, subprob...
Saved in:
| Superior document: | Foundations of computing |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Berlin : : Universitätsverlag der Technischen Universität Berlin,, 2021. |
| Year of Publication: | 2021 |
| Language: | English |
| Series: | Foundations of computing.
|
| Physical Description: | 1 online resource (213 pages). |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!