Elements of dynamic and 2-SAT programming: paths, trees, and cuts:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Hochschulschrift/Dissertation Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Berlin
Universitätsverlag der TU Berlin
2021
|
| Schriftenreihe: | Foundations of computing
14 |
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=033322315&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | xiv, 199 Seiten Illustrationen, Diagramme 21 cm x 14.8 cm |
| ISBN: | 9783798332096 3798332096 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV047940831 | ||
| 003 | DE-604 | ||
| 005 | 20220706 | ||
| 007 | t| | ||
| 008 | 220413s2021 gw a||| m||| 00||| eng d | ||
| 015 | |a 22,N15 |2 dnb | ||
| 016 | 7 | |a 1254978968 |2 DE-101 | |
| 020 | |a 9783798332096 |c Broschur : EUR 12.00 (DE), EUR 12.40 (AT) |9 978-3-7983-3209-6 | ||
| 020 | |a 3798332096 |9 3-7983-3209-6 | ||
| 024 | 3 | |a 9783798332096 | |
| 035 | |a (OCoLC)1312695049 | ||
| 035 | |a (DE-599)DNB1254978968 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-83 | ||
| 084 | |a ST 620 |0 (DE-625)143684: |2 rvk | ||
| 084 | |8 1\p |a 004 |2 23sdnb | ||
| 100 | 1 | |a Bentert, Matthias |e Verfasser |0 (DE-588)1255323760 |4 aut | |
| 245 | 1 | 0 | |a Elements of dynamic and 2-SAT programming: paths, trees, and cuts |c Matthias Bentert |
| 264 | 1 | |a Berlin |b Universitätsverlag der TU Berlin |c 2021 | |
| 300 | |a xiv, 199 Seiten |b Illustrationen, Diagramme |c 21 cm x 14.8 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Foundations of computing |v 14 | |
| 502 | |b Dissertation |c Technische Universität Berlin |d 2020 | ||
| 650 | 0 | 7 | |a Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Exakte Lösung |0 (DE-588)4348289-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Worst-Case-Laufzeit |0 (DE-588)4732657-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Dynamische Optimierung |0 (DE-588)4125677-3 |2 gnd |9 rswk-swf |
| 653 | |a graph diameter | ||
| 653 | |a shortest paths computation | ||
| 653 | |a flow and cut problems | ||
| 653 | |a resource allocation | ||
| 653 | |a computational biology | ||
| 653 | |a Graphdurchmesser | ||
| 653 | |a Berechnung kürzester Pfade | ||
| 653 | |a Fluss- und Schnittprobleme | ||
| 653 | |a Ressourcenverteilung | ||
| 653 | |a Bioinformatik | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |D s |
| 689 | 0 | 1 | |a Exakte Lösung |0 (DE-588)4348289-2 |D s |
| 689 | 0 | 2 | |a Worst-Case-Laufzeit |0 (DE-588)4732657-8 |D s |
| 689 | 0 | 3 | |a Dynamische Optimierung |0 (DE-588)4125677-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 710 | 2 | |a Technische Universität Berlin |b Universitätsbibliothek |0 (DE-588)5053182-7 |4 pbl | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-7983-3210-2 |w (DE-604)BV047940857 |
| 830 | 0 | |a Foundations of computing |v 14 |w (DE-604)BV042337479 |9 14 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=033322315&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a vlb |d 20220406 |q DE-101 |u https://d-nb.info/provenance/plan#vlb | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-033322315 | |
Datensatz im Suchindex
| _version_ | 1819360993064517632 |
|---|---|
| adam_text | TABLE
OF
CONTENTS
1
INTRODUCTION
1
1.1
DYNAMIC
PROGRAMMING
.................................................................
2
1.2
2-SAT
PROGRAMMING
.......................................................................
6
1.3
RESULTS
................................................................................................
9
2
PRELIMINARIES
13
2.1
NUMBER
THEORY
................................................................................
13
2.2
GRAPH
THEORY
...................................................................................
13
2.2.1
GRAPH
CLASSES
....................................................................
15
2.2.2
GRAPH
PARAMETERS
..............................................................
17
2.3
COMPLEXITY
CLASSES
AND
HYPOTHESES
...........................................
18
2.4
REDUCTIONS
BETWEEN
PROBLEMS
.......................................................
20
I
DYNAMIC
PROGRAMMING
23
3
DIAMETER
25
3.1
PROBLEM
DEFINITION
AND
RELATED
WORK
.........................................
26
3.2
PARAMETERS
MOTIVATED
BY
GRAPH
CLASSES
......................................
29
3.3
PARAMETERS
MOTIVATED
BY
PROPERTIES
OF
SOCIAL
NETWORKS
....
35
3.4
CONCLUDING
REMARKS
.......................................................................
43
4
LENGTH-BOUNDED
CUTS
45
4.1
PROBLEM
DEFINITION
AND
RELATED
WORK
.........................................
46
4.2
POLYNOMIAL-TIME
ALGORITHM
FOR
PROPER
INTERVAL
GRAPHS
....
48
4.3
FALSIFYING
ASSUMPTIONS
FOR
INTERVAL
GRAPHS
...............................
58
4.4
CONCLUDING
REMARKS
.......................................................................
60
XIII
5
DISJOINT
SHORTEST
PATHS
61
5.1
PROBLEM
DEFINITION
AND
RELATED
WORK
........................................
62
5.2
A
GEOMETRIC
VIEW
ON
SHORTEST
PATHS
...........................................
63
5.2.1
TWO
SHORTEST
PATHS
...........................................................
67
5.2.2
MORE
THAN
TWO
SHORTEST
PATHS
........................................
78
5.3
AN
AF-ALGORITHM
FOR
FC-DISJOLNT
S
HORTEST
P
ATHS
................
93
5.4
CONCLUDING
REMARKS
.......................................................................
100
II
2-SAT
PROGRAMMING
101
6
TREE
CONTAINMENT
103
6.1
PROBLEM
DEFINITION
AND
RELATED
WORK
........................................
104
6.2
SINGLE-LABELED
TREES
.......................................................................
109
6.3
MULTI-LABELED
TREES
AND
FC-SAT
.....................................................
114
6.3.1
REDUCTION
TO
FC-SAT
...........................................................
116
6.3.2
REDUCTION
FROM
A:-SAT........................................................
124
6.4
CONCLUDING
REMARKS
.......................................................................
131
7
REACHABLE
OBJECTS
133
7.1
PROBLEM
DEFINITION
AND
RELATED
WORK
........................................
135
7.2
LENGTH
OF
PREFERENCE
LISTS
..............................................................
137
7.2.1
MAXIMUM
LENGTH
AT
MOST
THREE
.......................................
138
7.2.2
MAXIMUM
LENGTH
AT
MOST
FOUR
........................................
144
7.3
CYCLES
................................................................................................
154
7.3.1
LIMITED
NUMBER
OF
CANDIDATES
........................................
159
7.3.2
COMPATIBILITY
OF
SOLUTIONS
..................................................
170
7.4
CONCLUDING
REMARKS
.......................................................................
180
8
OUTLOOK
183
BIBLIOGRAPHY
187
|
| any_adam_object | 1 |
| author | Bentert, Matthias |
| author_GND | (DE-588)1255323760 |
| author_facet | Bentert, Matthias |
| author_role | aut |
| author_sort | Bentert, Matthias |
| author_variant | m b mb |
| building | Verbundindex |
| bvnumber | BV047940831 |
| classification_rvk | ST 620 |
| ctrlnum | (OCoLC)1312695049 (DE-599)DNB1254978968 |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02772nam a2200661 cb4500</leader><controlfield tag="001">BV047940831</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220706 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">220413s2021 gw a||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">22,N15</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1254978968</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798332096</subfield><subfield code="c">Broschur : EUR 12.00 (DE), EUR 12.40 (AT)</subfield><subfield code="9">978-3-7983-3209-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3798332096</subfield><subfield code="9">3-7983-3209-6</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783798332096</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1312695049</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1254978968</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 620</subfield><subfield code="0">(DE-625)143684:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="8">1\p</subfield><subfield code="a">004</subfield><subfield code="2">23sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bentert, Matthias</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1255323760</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Elements of dynamic and 2-SAT programming: paths, trees, and cuts</subfield><subfield code="c">Matthias Bentert</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Universitätsverlag der TU Berlin</subfield><subfield code="c">2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiv, 199 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield><subfield code="c">21 cm x 14.8 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations of computing</subfield><subfield code="v">14</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Berlin</subfield><subfield code="d">2020</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Exakte Lösung</subfield><subfield code="0">(DE-588)4348289-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Worst-Case-Laufzeit</subfield><subfield code="0">(DE-588)4732657-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dynamische Optimierung</subfield><subfield code="0">(DE-588)4125677-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph diameter</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">shortest paths computation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">flow and cut problems</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">resource allocation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational biology</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Graphdurchmesser</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Berechnung kürzester Pfade</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Fluss- und Schnittprobleme</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Ressourcenverteilung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bioinformatik</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Exakte Lösung</subfield><subfield code="0">(DE-588)4348289-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Worst-Case-Laufzeit</subfield><subfield code="0">(DE-588)4732657-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Dynamische Optimierung</subfield><subfield code="0">(DE-588)4125677-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Technische Universität Berlin</subfield><subfield code="b">Universitätsbibliothek</subfield><subfield code="0">(DE-588)5053182-7</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-7983-3210-2</subfield><subfield code="w">(DE-604)BV047940857</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of computing</subfield><subfield code="v">14</subfield><subfield code="w">(DE-604)BV042337479</subfield><subfield code="9">14</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=033322315&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">vlb</subfield><subfield code="d">20220406</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#vlb</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033322315</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV047940831 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T19:32:59Z |
| institution | BVB |
| institution_GND | (DE-588)5053182-7 |
| isbn | 9783798332096 3798332096 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033322315 |
| oclc_num | 1312695049 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | xiv, 199 Seiten Illustrationen, Diagramme 21 cm x 14.8 cm |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | Universitätsverlag der TU Berlin |
| record_format | marc |
| series | Foundations of computing |
| series2 | Foundations of computing |
| spellingShingle | Bentert, Matthias Elements of dynamic and 2-SAT programming: paths, trees, and cuts Foundations of computing Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Exakte Lösung (DE-588)4348289-2 gnd Worst-Case-Laufzeit (DE-588)4732657-8 gnd Dynamische Optimierung (DE-588)4125677-3 gnd |
| subject_GND | (DE-588)4323820-8 (DE-588)4348289-2 (DE-588)4732657-8 (DE-588)4125677-3 (DE-588)4113937-9 |
| title | Elements of dynamic and 2-SAT programming: paths, trees, and cuts |
| title_auth | Elements of dynamic and 2-SAT programming: paths, trees, and cuts |
| title_exact_search | Elements of dynamic and 2-SAT programming: paths, trees, and cuts |
| title_full | Elements of dynamic and 2-SAT programming: paths, trees, and cuts Matthias Bentert |
| title_fullStr | Elements of dynamic and 2-SAT programming: paths, trees, and cuts Matthias Bentert |
| title_full_unstemmed | Elements of dynamic and 2-SAT programming: paths, trees, and cuts Matthias Bentert |
| title_short | Elements of dynamic and 2-SAT programming: paths, trees, and cuts |
| title_sort | elements of dynamic and 2 sat programming paths trees and cuts |
| topic | Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Exakte Lösung (DE-588)4348289-2 gnd Worst-Case-Laufzeit (DE-588)4732657-8 gnd Dynamische Optimierung (DE-588)4125677-3 gnd |
| topic_facet | Erfüllbarkeitsproblem Exakte Lösung Worst-Case-Laufzeit Dynamische Optimierung Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=033322315&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV042337479 |
| work_keys_str_mv | AT bentertmatthias elementsofdynamicand2satprogrammingpathstreesandcuts AT technischeuniversitatberlinuniversitatsbibliothek elementsofdynamicand2satprogrammingpathstreesandcuts |