Elements of dynamic and 2-SAT programming: paths, trees, and cuts
Matthias Bentert
Information
213 Pages
English
PDF
About This Book
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... (see more details)
Get access to thousands of e-books
with a single subscription
© 2022 Calibr, All rights reserved.
|||