Ata uhi

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Whakaatu ērā atu putanga (1)

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...

Whakaahuatanga katoa

I tiakina i:
Ngā taipitopito rārangi puna kōrero
Kaituhi matua: Bentert, Matthias (auth)
Hōputu: Tāhiko Wāhanga pukapuka
Reo:Ingarihi
I whakaputaina: Berlin Universitätsverlag der Technischen Universität Berlin 2021
Rangatū:Foundations of computing 14
Ngā marau:
Algorithms & data structures
graph diameter
shortest paths computation
flow and cut problems
resource allocation
computational biology
Urunga tuihono:OAPEN Library: download the publication
OAPEN Library: description of the publication
Ngā Tūtohu: Tāpirihia he Tūtohu
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!

Ipurangi

OAPEN Library: download the publication
OAPEN Library: description of the publication

3rd Floor Main Library

Ngā taipitopito puringa mai i 3rd Floor Main Library
Tau karanga: A1234.567
Tārua 1 Wātea

Ngā tūemi rite