Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Univ.-Verl. der TU Berlin
2014
|
| Schriftenreihe: | Foundations of computing
1 |
| Schlagworte: | |
| Online-Zugang: | Volltext Inhaltsverzeichnis |
| Beschreibung: | XIX, 205 S. graph. Darst. |
| ISBN: | 9783798327054 9783798327061 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV042337841 | ||
| 003 | DE-604 | ||
| 005 | 20150312 | ||
| 007 | t | ||
| 008 | 150210s2014 d||| m||| 00||| eng d | ||
| 020 | |a 9783798327054 |c Print |9 978-3-7983-2705-4 | ||
| 020 | |a 9783798327061 |c Online |9 978-3-7983-2706-1 | ||
| 035 | |a (OCoLC)903217344 | ||
| 035 | |a (DE-599)BVBBV042337841 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-83 | ||
| 100 | 1 | |a Bevern, René van |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations |c René van Bevern |
| 246 | 1 | |a Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations | |
| 264 | 1 | |a Berlin |b Univ.-Verl. der TU Berlin |c 2014 | |
| 300 | |a XIX, 205 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Foundations of computing |v 1 | |
| 502 | |a Zugl.: Berlin, Techn. Univ., Diss., 2014 | ||
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Hypergraph |0 (DE-588)4161063-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-hartes Problem |0 (DE-588)4621705-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 0 | 1 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 2 | |a Hypergraph |0 (DE-588)4161063-5 |D s |
| 689 | 0 | 3 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 4 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o urn:nbn:de:kobv:83-opus4-55292 |
| 830 | 0 | |a Foundations of computing |v 1 |w (DE-604)BV042337479 |9 1 | |
| 856 | 4 | 1 | |u https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-55292 |x Resolving-System |z kostenfrei |3 Volltext |
| 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=027774432&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027774432 | ||
Datensatz im Suchindex
| _version_ | 1804152946870452224 |
|---|---|
| adam_text | CONTENTS
1 INTRODUCTION 1
1.1 FIXED-PARAMETER LINEAR-TIME ALGORITHMS 3
1.2 LINEAR-TIME KERNELIZATION 4
1.3 OVERVIEW 5
2 PRELIMINARIES 7
2.1 SETS, RELATIONS, AND FUNCTIONS 7
2.2 GRAPH THEORY 10
2.2.1 GRAPHS AND HYPERGRAPHS 10
2.2.2 RELATIONS AND OPERATIONS ON GRAPHS 12
2.2.3 STRUCTURES, TOPOLOGY, AND PARAMETERS 14
2.2.4 GRAPH CLASSES AND SPECIAL GRAPHS 16
2.3 COMPUTATIONAL COMPLEXITY 17
2.3.1 WHAT IS TIME? 18
2.3.2 OPTIMIZATION PROBLEMS VERSUS DECISION PROBLEMS 19
2.3.3 P VERSUS NP 20
2.3.4 NP-HARDNESS AND COMPLETENESS 21
2.4 PARAMETERIZED COMPLEXITY 22
2.4.1 FIXED-PARAMETER TRACTABILITY 22
2.4.2 PARAMETERIZED HARDNESS 24
2.4.3 PROBLEM KERNELIZATION 24
2.4.4 LOWER BOUNDS ON THE PROBLEM KERNEL SIZE 25
2.5 FIXED-PARAMETER ALGORITHMS FOR GRAPHS OF BOUNDED TREEWIDTH ... 26
2.5.1 MONADIC SECOND-ORDER LOGIC 28
2.5.2 TREE AUTOMATA 29
3 JOB INTERVAL SELECTION AND 2-UNION INDEPENDENT SET 33
3.1 INTRODUCTION 34
3.1.1 KNOWN RESULTS 36
3.1.2 OUR RESULTS 37
XVII
HTTP://D-NB.INFO/1058974750
3.1.3 CHAPTER OUTLINE 39
3.2 COLORFUL INDEPENDENT SETS 40
3.2.1 A COLORFUL VERSION OF JOB INTERVAL SELECTION 40
3.2.2 COLORFUL INDEPENDENT SET WITH LISTS 42
3.2.3 ADVANTAGES AND LIMITATIONS OF THE MODEL 44
3.3 A COMPLEXITY DICHOTOMY 44
3.4 COMPACT INTERVAL GRAPHS 53
3.5 JOB INTERVAL SELECTION 57
3.5.1 A SIMPLE SEARCH TREE ALGORITHM 57
3.5.2 GENERALIZATIONS OF A KNOWN DYNAMIC PROGRAM 59
3.5.3 PROBLEM KERNELIZATION 67
3.6 2-UNION INDEPENDENT SET 72
3.6.1 A DYNAMIC PROGRAM FOR COMPACT INTERVAL GRAPHS 73
3.6.2 PROBLEM KERNELIZATION 74
3.7 EXPERIMENTAL EVALUATION 77
3.8 CONCLUSION 81
4 DAG PARTITIONING 83
4.1 INTRODUCTION 83
4.1.1 KNOWN RESULTS 84
4.1.2 OUR RESULTS 85
4.1.3 CHAPTER OUTLINE 86
4.2 THE STRUCTURE OF MINIMAL PARTITIONING SETS 86
4.3 FINDING CONSTANT-WEIGHT PARTITIONING SETS IN LINEAR TIME 88
4.3.1 A SEARCH TREE ALGORITHM 88
4.3.2 LINEAR-TIME DATA REDUCTION 92
4.3.3 LOWER BOUNDS 97
4.3.4 EXPERIMENTAL EVALUATION 105
4.4 LINEAR-TIME PARTITIONING TREE-LIKE GRAPHS 112
4.5 STRONGER NP-HARDNESS RESULTS 117
4.6 CONCLUSION 122
5 HITTING SET 123
5.1 INTRODUCTION 123
5.1.1 KNOWN RESULTS 124
5.1.2 OUR RESULTS 126
5.1.3 CHAPTER OUTLINE 126
5.2 EXPRESSIVE KERNELIZATION 126
XVIII
5.3 A LINEAR-TIME KERNELIZATION ALGORITHM 130
5.3.1 CORRECTNESS 132
5.3.2 PROBLEM KERNEL SIZE 134
5.3.3 RUNNING TIME 136
5.4 EXPERIMENTAL EVALUATION 138
5.5 REDUCING THE NUMBER OF VERTICES IN 0(A
15D
) ADDITIONAL TIME .... 145
5.5.1 THE APPROACHES OF ABU-KHZAM AND MOSER 145
5.5.2 OUR IMPROVEMENTS 147
5.6 CONCLUSION 150
6 HYPERGRAPH CUTWIDTH AND A GENERAL METHOD 151
6.1 INTRODUCTION 151
6.1.1 KNOWN RESULTS 154
6.1.2 OUR RESULTS 155
6.1.3 CHAPTER OUTLINE 155
6.2 A MYHILL-NERODE THEOREM FOR HYPERGRAPHS 155
6.2.1 REGULAR LANGUAGES 156
6.2.2 COLORED GRAPHS 156
6.2.3 HYPERGRAPHS 163
6.3 USING THE MYHILL-NERODE THEOREM 169
6.3.1 DERIVING FIXED-PARAMETER LINEAR-TIME ALGORITHMS 169
6.3.2 EXPRESSIBILITY IN MONADIC SECOND-ORDER LOGIC 171
6.4 HYPERGRAPH CUTWIDTH IS FIXED-PARAMETER LINEAR 173
6.4.1 HYPERGRAPH CUTWIDTH BOUNDS INCIDENCE TREEWIDTH 175
6.4.2 TESTS FOR CONSTANT CUTWIDTH 176
6.4.3 SHRINKING TESTS TO CONSTANT SIZE 181
6.5 HYPERTREE WIDTH AND VARIANTS 184
6.6 CONCLUSION 185
7 CONCLUSION AND OUTLOOK 187
BIBLIOGRAPHY 191
XIX
|
| any_adam_object | 1 |
| author | Bevern, René van |
| author_facet | Bevern, René van |
| author_role | aut |
| author_sort | Bevern, René van |
| author_variant | r v b rv rvb |
| building | Verbundindex |
| bvnumber | BV042337841 |
| collection | ebook |
| ctrlnum | (OCoLC)903217344 (DE-599)BVBBV042337841 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02333nam a2200505 cb4500</leader><controlfield tag="001">BV042337841</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150312 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">150210s2014 d||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798327054</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-7983-2705-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798327061</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-7983-2706-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)903217344</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042337841</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bevern, René van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations</subfield><subfield code="c">René van Bevern</subfield></datafield><datafield tag="246" ind1="1" ind2=" "><subfield code="a">Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Univ.-Verl. der TU Berlin</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 205 S.</subfield><subfield code="b">graph. Darst.</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">1</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Berlin, Techn. Univ., Diss., 2014</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="o">urn:nbn:de:kobv:83-opus4-55292</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of computing</subfield><subfield code="v">1</subfield><subfield code="w">(DE-604)BV042337479</subfield><subfield code="9">1</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-55292</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</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=027774432&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027774432</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV042337841 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T01:18:48Z |
| institution | BVB |
| isbn | 9783798327054 9783798327061 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027774432 |
| oclc_num | 903217344 |
| open_access_boolean | 1 |
| owner | DE-91 DE-BY-TUM DE-83 |
| owner_facet | DE-91 DE-BY-TUM DE-83 |
| physical | XIX, 205 S. graph. Darst. |
| psigel | ebook |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Univ.-Verl. der TU Berlin |
| record_format | marc |
| series | Foundations of computing |
| series2 | Foundations of computing |
| spelling | Bevern, René van Verfasser aut Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations René van Bevern Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations Berlin Univ.-Verl. der TU Berlin 2014 XIX, 205 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Foundations of computing 1 Zugl.: Berlin, Techn. Univ., Diss., 2014 Graph (DE-588)4021842-9 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Hypergraph (DE-588)4161063-5 gnd rswk-swf NP-hartes Problem (DE-588)4621705-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content NP-hartes Problem (DE-588)4621705-8 s Graph (DE-588)4021842-9 s Hypergraph (DE-588)4161063-5 s Berechnungskomplexität (DE-588)4134751-1 s Effizienter Algorithmus (DE-588)4125422-3 s DE-604 Erscheint auch als Online-Ausgabe urn:nbn:de:kobv:83-opus4-55292 Foundations of computing 1 (DE-604)BV042337479 1 https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-55292 Resolving-System kostenfrei Volltext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027774432&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Bevern, René van Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations Foundations of computing Graph (DE-588)4021842-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Hypergraph (DE-588)4161063-5 gnd NP-hartes Problem (DE-588)4621705-8 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4134751-1 (DE-588)4125422-3 (DE-588)4161063-5 (DE-588)4621705-8 (DE-588)4113937-9 |
| title | Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations |
| title_alt | Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations |
| title_auth | Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations |
| title_exact_search | Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations |
| title_full | Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations René van Bevern |
| title_fullStr | Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations René van Bevern |
| title_full_unstemmed | Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations René van Bevern |
| title_short | Fixed parameter linear time algorithms for NP-hard graph and hypergraph problems arising in industrial appliations |
| title_sort | fixed parameter linear time algorithms for np hard graph and hypergraph problems arising in industrial appliations |
| topic | Graph (DE-588)4021842-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Hypergraph (DE-588)4161063-5 gnd NP-hartes Problem (DE-588)4621705-8 gnd |
| topic_facet | Graph Berechnungskomplexität Effizienter Algorithmus Hypergraph NP-hartes Problem Hochschulschrift |
| url | https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-55292 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027774432&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV042337479 |
| work_keys_str_mv | AT bevernrenevan fixedparameterlineartimealgorithmsfornphardgraphandhypergraphproblemsarisinginindustrialappliations |