Invitation to fixed-parameter algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Oxford <<[u.a.]>>
Oxford Univ. Press
2008
|
| Ausgabe: | Reprint. |
| Schriftenreihe: | Oxford lecture series in mathematics and its applications
31 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | XI, 300 S. graph. Darst. |
| ISBN: | 9780198566076 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035990330 | ||
| 003 | DE-604 | ||
| 005 | 20100204 | ||
| 007 | t | ||
| 008 | 100202s2008 d||| m||| 00||| eng d | ||
| 020 | |a 9780198566076 |9 978-0-19-856607-6 | ||
| 035 | |a (OCoLC)316126611 | ||
| 035 | |a (DE-599)BVBBV035990330 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-83 |a DE-739 | ||
| 082 | 0 | |a 518.1 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Niedermeier, Rolf |d 19XX- |e Verfasser |0 (DE-588)105937899X |4 aut | |
| 245 | 1 | 0 | |a Invitation to fixed-parameter algorithms |c Rolf Niedermeier |
| 250 | |a Reprint. | ||
| 264 | 1 | |a Oxford <<[u.a.]>> |b Oxford Univ. Press |c 2008 | |
| 300 | |a XI, 300 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Oxford lecture series in mathematics and its applications |v 31 | |
| 500 | |a Includes bibliographical references and index | ||
| 502 | |a Teilw. zugl.: Tübingen, Univ., Habil.-Schr., 2002 | ||
| 650 | 7 | |a Algorithms |2 blmsh | |
| 650 | 4 | |a Algorithmus - Parameterschätzung - Kombinatorische Analysis | |
| 650 | 7 | |a Combinatorial analysis |2 blmsh | |
| 650 | 7 | |a Parameter estimation |2 blmsh | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorial analysis | |
| 650 | 4 | |a Parameter estimation | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parameterschätzung |0 (DE-588)4044614-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Parameterschätzung |0 (DE-588)4044614-1 |D s |
| 689 | 0 | 2 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Oxford lecture series in mathematics and its applications |v 31 |w (DE-604)BV009910017 |9 31 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018883050&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018883050 | ||
Datensatz im Suchindex
| _version_ | 1804141014507585536 |
|---|---|
| adam_text | CONTENTS
I FOUNDATIONS
1
Introduction to Fixed-Parameter Algorithms
3
1.1
The satisfiability problem
4
1.2
An example from railway optimization
7
1.3
A communication problem in tree networks
10
1.4
Summary
12
1.5
Exercises
13
1.6
Bibliographical remarks
14
2
Preliminaries and Agreements
17
2.1
Basic sets and problems
17
2.2
Model of computation and running times
17
2.3
Strings and graphs
18
2.4
Complexity and approximation
20
2.5
Bibliographical remarks
21
3
Parameterized Complexity Theory
—
A Primer
22
3.1
Basic theory
22
3.2
Interpreting fixed-parameter tractability
27
3.3
Exercises
29
3.4
Bibliographical remarks
29
4
Vertex Cover
—
An Illustrative Example
31
4.1
Parameterizing
32
4.2
Specializing
33
4.3
Generalizing
34
4.4
Counting or enumerating
34
4.5
Lower bounds
35
4.6
Implementing and applying
35
4.7
Using vertex cover structure for other problems
36
4.8
Exercises
38
4.9
Bibliographical remarks
38
5
The Art of Problem Parameterization
41
5.1
Parameter really small?
41
5.2
Guaranteed parameter value?
42
5.3
More than one obvious parameterization?
43
5.4
Close to trivial problem instances?
45
5.5
Exercises
47
5.6
Bibliographical remarks
47
vu
viii CONTENTS
6
Summary and Concluding Remarks
49
II ALGORITHMIC METHODS
7
Data Reduction and Problem Kernels
53
7.1
Basic definitions and facts
55
7.2
Maximum Satisfiability
58
7.3
Cluster Editing
60
7.4
Vertex Cover
64
7.4.1
Kernelization based on matching
64
7.4.2
Kernelization based on linear programming
68
7.4.3
Kernelization based on crown structures
69
7.4.4
Comparison and discussion
72
7.5
3-Hitting Set
72
7.6
Dominating Set in Planar Graphs
74
7.6.1
The neighborhood of a single vertex
74
7.6.2
The neighborhood of a pair of vertices
77
7.6.3
Reduced graphs and the problem kernel
79
7.7
On lower bounds for problem kernels
80
7.8
Summary and concluding remarks
82
7.9
Exercises
83
7.10
Bibliographical remarks
85
8
Depth-Bounded Search Trees
88
8.1
Basic definitions and facts
91
8.2
Cluster Editing
93
8.3
Vertex Cover
98
8.4
Hitting Set
101
8.5
Closest String
103
8.6
Dominating Set in Planar Graphs
107
8.6.1
Data reduction rules
108
8.6.2
Main result and some remarks
109
8.7
Interleaving search trees and kernelization
110
8.7.1
Basic methodology 111
8.7.2
Interleaving is necessary
113
8.8
Automated search tree generation and analysis
114
8.9
Summary and concluding remarks
119
8.10
Exercises
120
8.11
Bibliographical remarks
121
9
Dynamic Programming
124
9.1
Basic definitions and facts
125
9.2
Knapsack
126
9.3 Steiner
Problem in Graphs
128
9.4
Multicommodity Demand Flow in Trees
131
CONTENTS ix
9.5
Tree-structured variants of Set Cover
136
9.5.1
Basic definitions and facts
136
9.5.2
Algorithm for Path-like Weighted Set Cover
139
9.5.3
Algorithm for Tree-like Weighted Set Cover
140
9.6
Shrinking search trees
145
9.7
Summary and concluding remarks
146
9.8
Exercises
147
9.9
Bibliographical remarks
148
10
Tree Decompositions of Graphs
150
10.1
Basic definitions and facts
151
10.2
On the construction of tree decompositions
153
10.3
Planar graphs
155
10.4
Dynamic programming for Vertex Cover
160
10.5
Dynamic programming for Dominating Set
164
10.6
Monadic second-order logic (MSO)
169
10.7
Related graph width parameters
172
10.8
Summary and concluding remarks
174
10.9
Exercises
175
lO.lOBibliographical remarks
176
11
Further Advanced Techniques
177
11.1
Color-coding
178
11.2
Integer linear programming
181
11.3
Iterative compression
184
11.3.1
Vertex Cover
185
11.3.2
Feedback Vertex Set
187
11.4
Greedy localization
190
11.4.1
Set Splitting
191
11.4.2
Set Packing
193
11.5
Graph minor theory
195
11.6
Summary and concluding remarks
197
11.7
Exercises
198
11.8
Bibliographical remarks
199
12
Summary and Concluding Remarks
201
III SOME THEORY, SOME CASE STUDIES
13
Parameterized Complexity Theory
205
13.1
Basic definitions and concepts
206
13.1.1
Parameterized reducibility
207
13.1.2
Parameterized complexity classes
209
13.2
The complexity class W[l]
212
13.3
Concrete parameterized reductions
216
13.3.1
ИфЈ
-hardness
proofs
218
x
CONTENTS
13.3.2
Further reductions and W^J-hardness
226
13.4
Some recent developments
230
13.4.1
Lower bounds and the complexity class M[l]
230
13.4.2
Lower bounds and linear FPT reductions
232
13.4.3
Machine models, limited nondeterminism, and
bounded FPT
233
13.5
Summary and concluding remarks
234
13.6
Exercises
235
13.7
Bibliographical remarks
235
14
Connections to Approximation Algorithms
237
14.1
Approximation helping parameterization
238
14.2
Parameterization helping approximation
239
14.3
Further (non-)relations
241
14.4
Discussion and concluding remarks
241
14.5
Bibliographical remarks
242
15
Selected Case Studies
243
15.1
Planar and more general graphs
243
15.1.1
Planar graphs
243
15.1.2
More general graphs
245
15.2
Graph modification problems
245
15.2.1
Graph modification and hereditary properties
246
15.2.2
Feedback Vertex Set revisited
247
15.2.3
Graph Bipartization
248
15.2.4
Minimum Fill-in
249
15.2.5
Closest 3-Leaf Power
250
15.3
Miscellaneous graph problems
251
15.3.1
Capacitated Vertex Cover
251
15.3.2
Constraint Bipartite Vertex Cover
253
15.3.3
Graph Coloring
255
15.3.4
Crossing Number
256
15.3.5
Power Dominating Set
257
15.4
Computational biology problems
258
15.4.1
Minimum Quartet Inconsistency
259
15.4.2
Compatibility of Unrooted Phvlogenetic Trees
261
15.4.3
Longest Arc-Preserving Common Subsequences
262
15.4.4
Incomplete Perfect Path Phylogeny Haplotyp-
ing
264
15.5
Logic and related problems
266
15.5.1
Satisfiability
266
15.5.2
Maximum Satisfiability
268
15.5.3
Constraint satisfaction problems
269
15.5.4
Database queries
270
15.6
Miscellaneous problems
271
CONTENTS xi
15.6.1
Two-dimensional Euclidean TSP
272
15.6.2
Multidimensional matching
273
15.6.3
Matrix Domination
273
15.6.4
Vapnik-Chervonenkis Dimension
274
15.7
Summary and concluding remarks
275
16 Zukunftsmusik 277
References
279
Index
294
|
| any_adam_object | 1 |
| author | Niedermeier, Rolf 19XX- |
| author_GND | (DE-588)105937899X |
| author_facet | Niedermeier, Rolf 19XX- |
| author_role | aut |
| author_sort | Niedermeier, Rolf 19XX- |
| author_variant | r n rn |
| building | Verbundindex |
| bvnumber | BV035990330 |
| classification_rvk | SK 890 ST 134 |
| ctrlnum | (OCoLC)316126611 (DE-599)BVBBV035990330 |
| dewey-full | 518.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518.1 |
| dewey-search | 518.1 |
| dewey-sort | 3518.1 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| edition | Reprint. |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02245nam a2200541 cb4500</leader><controlfield tag="001">BV035990330</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100204 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100202s2008 d||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780198566076</subfield><subfield code="9">978-0-19-856607-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)316126611</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035990330</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-20</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Niedermeier, Rolf</subfield><subfield code="d">19XX-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)105937899X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Invitation to fixed-parameter algorithms</subfield><subfield code="c">Rolf Niedermeier</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Reprint.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oxford <<[u.a.]>></subfield><subfield code="b">Oxford Univ. Press</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 300 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">Oxford lecture series in mathematics and its applications</subfield><subfield code="v">31</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Teilw. zugl.: Tübingen, Univ., Habil.-Schr., 2002</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">blmsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmus - Parameterschätzung - Kombinatorische Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial analysis</subfield><subfield code="2">blmsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parameter estimation</subfield><subfield code="2">blmsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parameter estimation</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parameterschätzung</subfield><subfield code="0">(DE-588)4044614-1</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Parameterschätzung</subfield><subfield code="0">(DE-588)4044614-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Oxford lecture series in mathematics and its applications</subfield><subfield code="v">31</subfield><subfield code="w">(DE-604)BV009910017</subfield><subfield code="9">31</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</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=018883050&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018883050</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035990330 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:09:08Z |
| institution | BVB |
| isbn | 9780198566076 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018883050 |
| oclc_num | 316126611 |
| open_access_boolean | |
| owner | DE-20 DE-83 DE-739 |
| owner_facet | DE-20 DE-83 DE-739 |
| physical | XI, 300 S. graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Oxford Univ. Press |
| record_format | marc |
| series | Oxford lecture series in mathematics and its applications |
| series2 | Oxford lecture series in mathematics and its applications |
| spelling | Niedermeier, Rolf 19XX- Verfasser (DE-588)105937899X aut Invitation to fixed-parameter algorithms Rolf Niedermeier Reprint. Oxford <<[u.a.]>> Oxford Univ. Press 2008 XI, 300 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Oxford lecture series in mathematics and its applications 31 Includes bibliographical references and index Teilw. zugl.: Tübingen, Univ., Habil.-Schr., 2002 Algorithms blmsh Algorithmus - Parameterschätzung - Kombinatorische Analysis Combinatorial analysis blmsh Parameter estimation blmsh Algorithms Combinatorial analysis Parameter estimation Algorithmus (DE-588)4001183-5 gnd rswk-swf Kombinatorische Analysis (DE-588)4164746-4 gnd rswk-swf Parameterschätzung (DE-588)4044614-1 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Algorithmus (DE-588)4001183-5 s Parameterschätzung (DE-588)4044614-1 s Kombinatorische Analysis (DE-588)4164746-4 s DE-604 Oxford lecture series in mathematics and its applications 31 (DE-604)BV009910017 31 Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018883050&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Niedermeier, Rolf 19XX- Invitation to fixed-parameter algorithms Oxford lecture series in mathematics and its applications Algorithms blmsh Algorithmus - Parameterschätzung - Kombinatorische Analysis Combinatorial analysis blmsh Parameter estimation blmsh Algorithms Combinatorial analysis Parameter estimation Algorithmus (DE-588)4001183-5 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd Parameterschätzung (DE-588)4044614-1 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4164746-4 (DE-588)4044614-1 (DE-588)4113937-9 |
| title | Invitation to fixed-parameter algorithms |
| title_auth | Invitation to fixed-parameter algorithms |
| title_exact_search | Invitation to fixed-parameter algorithms |
| title_full | Invitation to fixed-parameter algorithms Rolf Niedermeier |
| title_fullStr | Invitation to fixed-parameter algorithms Rolf Niedermeier |
| title_full_unstemmed | Invitation to fixed-parameter algorithms Rolf Niedermeier |
| title_short | Invitation to fixed-parameter algorithms |
| title_sort | invitation to fixed parameter algorithms |
| topic | Algorithms blmsh Algorithmus - Parameterschätzung - Kombinatorische Analysis Combinatorial analysis blmsh Parameter estimation blmsh Algorithms Combinatorial analysis Parameter estimation Algorithmus (DE-588)4001183-5 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd Parameterschätzung (DE-588)4044614-1 gnd |
| topic_facet | Algorithms Algorithmus - Parameterschätzung - Kombinatorische Analysis Combinatorial analysis Parameter estimation Algorithmus Kombinatorische Analysis Parameterschätzung Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018883050&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV009910017 |
| work_keys_str_mv | AT niedermeierrolf invitationtofixedparameteralgorithms |