Verfügbarkeit: Exact exponential algorithms | Technische Universität München

Exact exponential algorithms:

Gespeichert in:

Bibliographische Detailangaben
Beteiligte Personen:	Fomin, Fedor V. (VerfasserIn), Kratsch, Dieter 1959- (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Berlin ; Heidelberg Springer [2010]
Schriftenreihe:	Texts in theoretical computer science
Schlagwörter:	Optimierung Algorithmische Programmierung Dynamische Optimierung Exponentialzeitalgorithmus
Links:	http://deposit.dnb.de/cgi-bin/dokserv?id=3537169&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020719477&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	XIII, 203 Seiten Diagramme 235 mm x 155 mm
ISBN:	364216532X 9783642165320

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV036803345
003	DE-604
005	20240701
007	t\|
008	101129s2010 gw \|\|\|\| \|\|\|\| 00\|\|\| eng d
015			\|a 10,N38 \|2 dnb
016	7		\|a 1006975780 \|2 DE-101
020			\|a 364216532X \|c Gb. : EUR 64.15 (DE) (freier Pr.), sfr 86.00 (freier Pr.) \|9 3-642-16532-X
020			\|a 9783642165320 \|c Gb. : EUR 64.15 (DE) (freier Pr.), sfr 86.00 (freier Pr.) \|9 978-3-642-16532-0
024	3		\|a 9783642165320
028	5	2	\|a Best.-Nr.: 12767496
035			\|a (OCoLC)700563149
035			\|a (DE-599)DNB1006975780
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
044			\|a gw \|c XA-DE-BE
049			\|a DE-20 \|a DE-703 \|a DE-91G \|a DE-83 \|a DE-11 \|a DE-188 \|a DE-355
082	0		\|a 004.0151 \|2 22/ger
082	0		\|a 511.352 \|2 22/ger
084			\|a ST 134 \|0 (DE-625)143590: \|2 rvk
084			\|a 68W40 \|2 msc
084			\|a 68Q25 \|2 msc
084			\|a DAT 530f \|2 stub
084			\|a 004 \|2 sdnb
100	1		\|a Fomin, Fedor V. \|e Verfasser \|0 (DE-588)142598348 \|4 aut
245	1	0	\|a Exact exponential algorithms \|c Fedor V. Fomin, Dieter Kratsch
264		1	\|a Berlin ; Heidelberg \|b Springer \|c [2010]
300			\|a XIII, 203 Seiten \|b Diagramme \|c 235 mm x 155 mm
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a Texts in theoretical computer science
650	0	7	\|a Optimierung \|0 (DE-588)4043664-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmische Programmierung \|0 (DE-588)4293504-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Dynamische Optimierung \|0 (DE-588)4125677-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Exponentialzeitalgorithmus \|0 (DE-588)7730476-7 \|2 gnd \|9 rswk-swf
689	0	0	\|a Exponentialzeitalgorithmus \|0 (DE-588)7730476-7 \|D s
689	0	1	\|a Dynamische Optimierung \|0 (DE-588)4125677-3 \|D s
689	0		\|5 DE-604
689	1	0	\|a Algorithmische Programmierung \|0 (DE-588)4293504-0 \|D s
689	1	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	1		\|8 1\p \|5 DE-604
700	1		\|a Kratsch, Dieter \|d 1959- \|e Verfasser \|0 (DE-588)1061050084 \|4 aut
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|z 978-3-642-16533-7
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=3537169&prov=M&dok_var=1&dok_ext=htm \|3 Inhaltstext
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=020719477&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-020719477

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 DAT 530f 2011 A 1353
DE-BY-TUM_katkey	1749918
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040010204652
_version_	1821933268729069568
adam_text	IMAGE 1 CONTENTS PREFACE V 1 INTRODUCTION 1 1.1 PRELIMINARIES 1 1.2 DYNAMIC PROGRAMMING FOR TSP 4 1.3 A BRANCHING ALGORITHM FOR INDEPENDENT SET 7 2 BRANCHING 13 2.1 FUNDAMENTALS 14 2.2 JT-SATISFIABILITY 18 2.3 INDEPENDENT SET 23 3 DYNAMIC PROGRAMMING 31 3.1 BASIC EXAMPLES 32 3.1.1 PERMUTATION PROBLEMS 32 3.1.2 PARTITION PROBLEMS 34 3.2 SET COVER AND DOMINATING SET 36 3.3 TSP ON GRAPHS OF BOUNDED DEGREE 41 3.4 PARTITION INTO SETS OF BOUNDED CARDINALITY 43 4 INCLUSION-EXCLUSION 51 4.1 THE INCLUSION-EXCLUSION PRINCIPLE 51 4.2 SOME INCLUSION-EXCLUSION ALGORITHMS 53 4.2.1 COMPUTING THE PERMANENT OF A MATRIX 53 4.2.2 DIRECTED HAMILTONIAN PATH 56 4.2.3 BIN PACKING 59 4.3 COVERINGS AND PARTITIONS 60 4.3.1 COVERINGS AND GRAPH COLORING 61 4.3.2 PARTITIONS 64 4.3.3 POLYNOMIAL SPACE ALGORITHMS 66 4.4 COUNTING SUBGRAPH ISOMORPHISMS 68 BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1006975780 DIGITALISIERT DURCH IMAGE 2 XII CONTENTS 5 TREEWIDTH 77 5.1 DEFINITION AND DYNAMIC PROGRAMMING 77 5.2 GRAPHS OF MAXIMUM DEGREE 3 81 5.3 COUNTING HOMOMORPHISMS 86 5.4 COMPUTING TREEWIDTH 91 5.4.1 COMPUTING THE TREEWIDTH USING POTENTIAL MAXIMAL CLIQUES 92 5.4.2 COUNTING MINIMAL SEPARATORS AND POTENTIAL MAXIMAL CLIQUES 96 6 MEASURE & CONQUER 101 6.1 INDEPENDENT SET 102 6.2 FEEDBACK VERTEX SET 106 6.2.1 AN ALGORITHM FOR FEEDBACK VERTEX SET 108 6.2.2 COMPUTING A MINIMUM FEEDBACK VERTEX SET 109 6.3 DOMINATING SET 113 6.3.1 THE ALGORITHM MSC 114 6.3.2 A MEASURE & CONQUER ANALYSIS 116 6.4 LOWER BOUNDS 120 7 SUBSET CONVOLUTION 125 7.1 FAST ZETA TRANSFORM 126 7.2 FAST SUBSET CONVOLUTION 128 7.3 APPLICATIONS AND VARIANTS 132 7.4 /-WIDTH AND RANK-WIDTH 136 8 LOCAL SEARCH AND SAT 141 8.1 RANDOM WALKS TO SATISFYING ASSIGNMENTS 142 8.2 SEARCHING BALLS AND COVER CODES 146 9 SPLIT AND LIST 153 9.1 SORT AND SEARCH 153 9.2 MAXIMUM CUT 158 10 TIME VERSUS SPACE 161 10.1 SPACE FOR TIME: DIVIDE & CONQUER 161 10.2 TIME FOR SPACE: MEMORIZATION 166 11 MISCELLANEOUS 171 11.1 BANDWIDTH 171 11.2 BRANCH & RECHARGE 175 11.3 SUBEXPONENTIAL ALGORITHMS AND ETH 179 12 CONCLUSIONS, OPEN PROBLEMS AND FURTHER DIRECTIONS 187 REFERENCES 189 APPENDIX: GRAPHS 199 IMAGE 3 CONTENTS XIII INDEX 201
any_adam_object	1
author	Fomin, Fedor V. Kratsch, Dieter 1959-
author_GND	(DE-588)142598348 (DE-588)1061050084
author_facet	Fomin, Fedor V. Kratsch, Dieter 1959-
author_role	aut aut
author_sort	Fomin, Fedor V.
author_variant	f v f fv fvf d k dk
building	Verbundindex
bvnumber	BV036803345
classification_rvk	ST 134
classification_tum	DAT 530f
ctrlnum	(OCoLC)700563149 (DE-599)DNB1006975780
dewey-full	004.0151 511.352
dewey-hundreds	000 - Computer science, information, general works 500 - Natural sciences and mathematics
dewey-ones	004 - Computer science 511 - General principles of mathematics
dewey-raw	004.0151 511.352
dewey-search	004.0151 511.352
dewey-sort	14.0151
dewey-tens	000 - Computer science, information, general works 510 - Mathematics
discipline	Informatik Mathematik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02591nam a2200601 c 4500</leader><controlfield tag="001">BV036803345</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240701 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">101129s2010 gw \|\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10,N38</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1006975780</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">364216532X</subfield><subfield code="c">Gb. : EUR 64.15 (DE) (freier Pr.), sfr 86.00 (freier Pr.)</subfield><subfield code="9">3-642-16532-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642165320</subfield><subfield code="c">Gb. : EUR 64.15 (DE) (freier Pr.), sfr 86.00 (freier Pr.)</subfield><subfield code="9">978-3-642-16532-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642165320</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 12767496</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)700563149</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1006975780</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-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.352</subfield><subfield code="2">22/ger</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="084" ind1=" " ind2=" "><subfield code="a">68W40</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fomin, Fedor V.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)142598348</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Exact exponential algorithms</subfield><subfield code="c">Fedor V. Fomin, Dieter Kratsch</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">[2010]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 203 Seiten</subfield><subfield code="b">Diagramme</subfield><subfield code="c">235 mm x 155 mm</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="0" ind2=" "><subfield code="a">Texts in theoretical computer science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</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="650" ind1="0" ind2="7"><subfield code="a">Exponentialzeitalgorithmus</subfield><subfield code="0">(DE-588)7730476-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Exponentialzeitalgorithmus</subfield><subfield code="0">(DE-588)7730476-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="689" ind1="1" ind2="0"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kratsch, Dieter</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1061050084</subfield><subfield code="4">aut</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-642-16533-7</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3537169&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=020719477&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">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020719477</subfield></datafield></record></collection>
id	DE-604.BV036803345
illustrated	Not Illustrated
indexdate	2024-12-20T14:42:27Z
institution	BVB
isbn	364216532X 9783642165320
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-020719477
oclc_num	700563149
open_access_boolean
owner	DE-20 DE-703 DE-91G DE-BY-TUM DE-83 DE-11 DE-188 DE-355 DE-BY-UBR
owner_facet	DE-20 DE-703 DE-91G DE-BY-TUM DE-83 DE-11 DE-188 DE-355 DE-BY-UBR
physical	XIII, 203 Seiten Diagramme 235 mm x 155 mm
publishDate	2010
publishDateSearch	2010
publishDateSort	2010
publisher	Springer
record_format	marc
series2	Texts in theoretical computer science
spellingShingle	Fomin, Fedor V. Kratsch, Dieter 1959- Exact exponential algorithms Optimierung (DE-588)4043664-0 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Dynamische Optimierung (DE-588)4125677-3 gnd Exponentialzeitalgorithmus (DE-588)7730476-7 gnd
subject_GND	(DE-588)4043664-0 (DE-588)4293504-0 (DE-588)4125677-3 (DE-588)7730476-7
title	Exact exponential algorithms
title_auth	Exact exponential algorithms
title_exact_search	Exact exponential algorithms
title_full	Exact exponential algorithms Fedor V. Fomin, Dieter Kratsch
title_fullStr	Exact exponential algorithms Fedor V. Fomin, Dieter Kratsch
title_full_unstemmed	Exact exponential algorithms Fedor V. Fomin, Dieter Kratsch
title_short	Exact exponential algorithms
title_sort	exact exponential algorithms
topic	Optimierung (DE-588)4043664-0 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Dynamische Optimierung (DE-588)4125677-3 gnd Exponentialzeitalgorithmus (DE-588)7730476-7 gnd
topic_facet	Optimierung Algorithmische Programmierung Dynamische Optimierung Exponentialzeitalgorithmus
url	http://deposit.dnb.de/cgi-bin/dokserv?id=3537169&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020719477&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT fominfedorv exactexponentialalgorithms AT kratschdieter exactexponentialalgorithms

Verfügbarkeit

Bestellen (Login erforderlich)

Inhaltsverzeichnis
Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 DAT 530f 2011 A 1353 Lageplan
Exemplar 1	Ausleihbar Am Standort