Algorithm design:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston ; Munich [u.a.]
Pearson/Addison-Wesley
2006
|
| Ausgabe: | Pearson internat. ed. |
| Schlagworte: | |
| Online-Zugang: | Table of contents Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references (p. [805]-814) and index |
| Beschreibung: | XXIII, 838 S. ill. 24 cm |
| ISBN: | 0321372913 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV020830562 | ||
| 003 | DE-604 | ||
| 005 | 20160613 | ||
| 007 | t | ||
| 008 | 051013s2006 xxua||| |||| 00||| eng d | ||
| 020 | |a 0321372913 |c alk. paper |9 0-321-37291-3 | ||
| 035 | |a (OCoLC)255203590 | ||
| 035 | |a (DE-599)BVBBV020830562 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-703 |a DE-29T |a DE-739 |a DE-573 |a DE-91G |a DE-20 |a DE-384 |a DE-83 |a DE-355 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 005.1 |2 22 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 68Wxx |2 msc | ||
| 084 | |a DAT 530f |2 stub | ||
| 100 | 1 | |a Kleinberg, Jon |d 1971- |e Verfasser |0 (DE-588)13613887X |4 aut | |
| 245 | 1 | 0 | |a Algorithm design |c Jon Kleinberg, Éva Tardos |
| 250 | |a Pearson internat. ed. | ||
| 264 | 1 | |a Boston ; Munich [u.a.] |b Pearson/Addison-Wesley |c 2006 | |
| 300 | |a XXIII, 838 S. |b ill. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes bibliographical references (p. [805]-814) and index | ||
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Tardos, Éva |d 1957- |e Verfasser |0 (DE-588)140445382 |4 aut | |
| 856 | 4 | |u http://www.loc.gov/catdir/toc/ecip056/2005000401.html |3 Table of contents | |
| 856 | 4 | 2 | |m Digitalisierung UB Augsburg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013835785&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-013835785 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804134162151505920 |
|---|---|
| adam_text | Contents
About the Authors
v
Preface
xiii
1
Introduction: Some Representative Problems
1
1.1
A First Problem: Stable Matching
1
1.2
Five Representative Problems
12
Solved Exercises
19
Exercises
22
Notes and Further Reading
28
2
Basics of Algorithm Analysis
29
2.1
Computational Tractability
29
2.2
Asymptotic Order of Growth
35
2.3
Implementing the Stable Matching Algorithm Using Lists and
Arrays
42
2.4
A Survey of Common Running Times
47
2.5
A More Complex Data Structure: Priority Queues
57
Solved Exercises
65
Exercises
67
Notes and Further Reading
70
3
Graphs
73
3.1
Basic Definitions and Applications
73
3.2
Graph Connectivity and Graph Traversal
78
3.3
Implementing Graph Traversal Using Queues and Stacks
87
3.4
Testing Bipartiteness: An Application of Breadth-First Search
94
3.5
Connectivity in Directed Graphs
97
3.6
Directed Acyclic Graphs and Topological Ordering
99
Solved Exercises
104
Exercises
107
Notes and Further Reading
112
Greedy Algorithms
115
4.1
Interval Scheduling: The Greedy Algorithm Stays Ahead
116
4.2
Scheduling to Minimize Lateness: An Exchange Argument
125
4.3
Optimal Caching: A More Complex Exchange Argument
131
4.4
Shortest Paths in a Graph
137
4.5
The Minimum Spanning Tree Problem
142
4.6
Implementing
Kruskaľs
Algorithm: The Union-Find Data
Structure
151
4.7
Clustering
157
4.8
Huffman Codes and Data Compression
161
:
4.9
Minimum-Cost
Arborescences: A
Multi-Phase Greedy
Algorithm
177
Solved Exercises
183
Exercises
188
Notes and Further Reading
205
Divide and Conquer
209
5.1
A First Recurrence: The Mergesort Algorithm
210
5.2
Further Recurrence Relations
214
5.3
Counting Inversions
221
5.4
Finding the Closest Pair of Points
225
5.5
Integer Multiplication
231
5.6
Convolutions and the Fast Fourier Transform
234
Solved Exercises
242
Exercises
246
Notes and Further Reading
249
Dynamic Programming
251
6.1
Weighted Interval Scheduling: A Recursive Procedure
252
6.2
Principles of Dynamic Programming: Memoization or Iteration
over Subproblems
258
6.3
Segmented Least Squares: Multi-way Choices
261
Contents
6.4
Subset Sums and Knapsacks: Adding a Variable
266
6.5
RNA
Secondary Structure: Dynamic Programming over
Intervals
272
6.6
Sequence Alignment
278
6.7
Sequence Alignment in Linear Space via Divide and
Conquer
284
6.8
Shortest Paths in a Graph
290
6.9
Shortest Paths and Distance Vector Protocols
297
* 6.10
Negative Cycles in a Graph
301
Solved Exercises
307
Exercises
312
Notes and Further Reading
335
7
Network Flow
337
7.1
The Maximum-Flow Problem and the Ford-Fulkerson
Algorithm
338
7.2
Maximum Flows and Minimum Cuts in a Network
346
73
Choosing Good Augmenting Paths
352
* 7.4
The Preflow-Push Maximum-Flow Algorithm
357
7.5
A First
Application:
The Bipartite Matching Problem
367
7.6
Disjoint Paths in Directed and Undirected Graphs
373
7.7
Extensions to the Maximum-Flow Problem
378
7.8
Survey Design
384
7.9
Airline Scheduling
387
7.10
Image Segmentation
391
7.11
Project Selection
396
7.12
Baseball Elimination
400
* 7.13
A Further Direction: Adding Costs to the Matching Problem
404
Solved Exercises
411
Exercises
415
Notes and Further Reading
448
S
NP
and Computational Intractability
451
8.1
Polynomial-Time Reductions
452
8.2
Reductions via Gadgets : The Satisfiability Problem
459
8.3
Efficient Certification and the Definition of NP
463
8.4
NP-Complete Problems
466
8.5
Sequencing Problems
473
8.6
Partitioning Problems
481
8.7
Graph Coloring
485
8.8
Numerical Problems
490
8.9
Co-NP and the Asymmetry of NP
495
8.10
A Partial Taxonomy of Hard Problems
497
Solved Exercises
500
Exercises
505
Notes and Further Reading
529
9
PSPACE: A Class of Problems beyond NP
531
9.1
PSPACE
531
9.2
Some Hard Problems in PSPACE
533
9.3
Solving Quantified Problems and Games in Polynomial
Space
536
9.4
Solving the Planning Problem in Polynomial Space
538
9.5
Proving Problems PSPACE-Complete
543
Solved Exercises
547
Exercises
550
Notes and Further Reading
551
10
Extending the Limits of Tractability
553
10.1
Finding Small Vertex Covers
554
10.2
Solving NP-Hard Problems on Trees
558
10.3
Coloring a Set of Circular Arcs
563
* 10.4
Tree Decompositions of Graphs
572
* 10.5
Constructing a Tree Decomposition
584
Solved Exercises
591
Exercises
594
Notes and Further Reading
598
11
Approximation Algorithms
599
11.1
Greedy Algorithms and Bounds on the Optimum: A Load
Balancing Problem
600
11.2
The Center Selection Problem
606
11.3
Set Cover: A General Greedy Heuristic
612
11.4
The Pricing Method: Vertex Cover
618
11.5
Maximization via the Pricing Method: The Disjoint Paths
Problem
624
11.6
Linear Programming and Rounding: An Application to Vertex
Cover
630
* 11.7
Load Balancing Revisited: A More Advanced LP Application
637
Contents
11.8
Arbitrarily Good
Approximations:
The Knapsack
Problem 644
Solved Exercises
649
Exercises
651
Notes and Further Reading
659
12
Local Search
661
12.1
The Landscape of an Optimization Problem
662
12.2
The Metropolis Algorithm and Simulated Annealing
666
12.3
An Application of Local Search to Hopfield Neural Networks
671
12.4
Maximum-Cut Approximation via Local Search
676
12.5
Choosing a Neighbor Relation
679
* 12.6
Classification via Local Search
681
12.7
Best-Response Dynamics and Nash Equilibria
690
Solved Exercises
700
Exercises
702
Notes and Further Reading
705
13
Randomized Algorithms
707
13.1
A First Application: Contention Resolution
708
13.2
Finding the Global Minimum Cut
714
13.3
Random Variables and Their Expectations
719
13.4
A Randomized Approximation Algorithm for MAX 3-SAT
724
13.5
Randomized Divide and Conquer: Median-Finding and
Quicksort
727
13.6
Hashing: A Randomized Implementation of Dictionaries
734
13.7
Finding the Closest Pair of Points: A Randomized Approach
741
13.8
Randomized Caching
750
13.9
Chernoff Bounds
758
13.10
Load Balancing
760
13.11
Packet Routing
762
13.12
Background: Some Basic Probability Definitions
769
Solved Exercises
776
Exercises
782
Notes and Further Reading
793
Epilogue: Algorithms That Run Forever
795
References
805
Index
815
|
| any_adam_object | 1 |
| author | Kleinberg, Jon 1971- Tardos, Éva 1957- |
| author_GND | (DE-588)13613887X (DE-588)140445382 |
| author_facet | Kleinberg, Jon 1971- Tardos, Éva 1957- |
| author_role | aut aut |
| author_sort | Kleinberg, Jon 1971- |
| author_variant | j k jk é t ét |
| building | Verbundindex |
| bvnumber | BV020830562 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)255203590 (DE-599)BVBBV020830562 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | Pearson internat. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01952nam a2200481zc 4500</leader><controlfield tag="001">BV020830562</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160613 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">051013s2006 xxua||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0321372913</subfield><subfield code="c">alk. paper</subfield><subfield code="9">0-321-37291-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)255203590</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV020830562</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</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">68Wxx</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="100" ind1="1" ind2=" "><subfield code="a">Kleinberg, Jon</subfield><subfield code="d">1971-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)13613887X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithm design</subfield><subfield code="c">Jon Kleinberg, Éva Tardos</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Pearson internat. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Munich [u.a.]</subfield><subfield code="b">Pearson/Addison-Wesley</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIII, 838 S.</subfield><subfield code="b">ill.</subfield><subfield code="c">24 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="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. [805]-814) and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tardos, Éva</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140445382</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/toc/ecip056/2005000401.html</subfield><subfield code="3">Table of contents</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Augsburg</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=013835785&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-013835785</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></record></collection> |
| id | DE-604.BV020830562 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T20:20:13Z |
| institution | BVB |
| isbn | 0321372913 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013835785 |
| oclc_num | 255203590 |
| open_access_boolean | |
| owner | DE-703 DE-29T DE-739 DE-573 DE-91G DE-BY-TUM DE-20 DE-384 DE-83 DE-355 DE-BY-UBR |
| owner_facet | DE-703 DE-29T DE-739 DE-573 DE-91G DE-BY-TUM DE-20 DE-384 DE-83 DE-355 DE-BY-UBR |
| physical | XXIII, 838 S. ill. 24 cm |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Pearson/Addison-Wesley |
| record_format | marc |
| spelling | Kleinberg, Jon 1971- Verfasser (DE-588)13613887X aut Algorithm design Jon Kleinberg, Éva Tardos Pearson internat. ed. Boston ; Munich [u.a.] Pearson/Addison-Wesley 2006 XXIII, 838 S. ill. 24 cm txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references (p. [805]-814) and index Computer algorithms Data structures (Computer science) Algorithmus (DE-588)4001183-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Informatik (DE-588)4026894-9 s 1\p DE-604 Tardos, Éva 1957- Verfasser (DE-588)140445382 aut http://www.loc.gov/catdir/toc/ecip056/2005000401.html Table of contents Digitalisierung UB Augsburg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013835785&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Kleinberg, Jon 1971- Tardos, Éva 1957- Algorithm design Computer algorithms Data structures (Computer science) Algorithmus (DE-588)4001183-5 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4026894-9 |
| title | Algorithm design |
| title_auth | Algorithm design |
| title_exact_search | Algorithm design |
| title_full | Algorithm design Jon Kleinberg, Éva Tardos |
| title_fullStr | Algorithm design Jon Kleinberg, Éva Tardos |
| title_full_unstemmed | Algorithm design Jon Kleinberg, Éva Tardos |
| title_short | Algorithm design |
| title_sort | algorithm design |
| topic | Computer algorithms Data structures (Computer science) Algorithmus (DE-588)4001183-5 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Computer algorithms Data structures (Computer science) Algorithmus Informatik |
| url | http://www.loc.gov/catdir/toc/ecip056/2005000401.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013835785&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT kleinbergjon algorithmdesign AT tardoseva algorithmdesign |