Algorithm design and applications:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Hoboken, NJ
Wiley
2015
|
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027729108&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Beschreibung: | Includes bibliographical references and index |
| Umfang: | XVI, 784 S. Ill., graf. Darst. |
| ISBN: | 9781118335918 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV042291959 | ||
| 003 | DE-604 | ||
| 005 | 20150224 | ||
| 007 | t| | ||
| 008 | 150127s2015 xx a||| |||| 00||| eng d | ||
| 010 | |a 2014021534 | ||
| 020 | |a 9781118335918 |c hardback |9 978-1-118-33591-8 | ||
| 035 | |a (OCoLC)903584196 | ||
| 035 | |a (DE-599)GBV787120936 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-573 |a DE-188 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Goodrich, Michael T. |d 1961- |e Verfasser |0 (DE-588)121131181 |4 aut | |
| 245 | 1 | 0 | |a Algorithm design and applications |c Michael T. Goodrich ; Roberto Tamassia |
| 264 | 1 | |a Hoboken, NJ |b Wiley |c 2015 | |
| 300 | |a XVI, 784 S. |b Ill., graf. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Entwurf |0 (DE-588)4121208-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Anwendung |0 (DE-588)4196864-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Entwurf |0 (DE-588)4121208-3 |D s |
| 689 | 0 | 2 | |a Anwendung |0 (DE-588)4196864-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Tamassia, Roberto |d 1960- |e Verfasser |0 (DE-588)141557834 |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027729108&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027729108 | |
Datensatz im Suchindex
| _version_ | 1819379295517147136 |
|---|---|
| adam_text | Contents
Preface
xi
1
Algorithm Analysis
1
1.1
Analyzing Algorithms
....................... 3
1.2
A Quick Mathematical Review
.................. 19
1.3
A Case Study in Algorithm Analysis
.............. 29
1.4
Amortization
........................... 34
1.5
Exercises
............................. 42
Part I: Data Structures
2
Basic Data Structures
51
2.1
Stacks and Queues
....................... 53
2.2
Lists
................................ 60
2.3
Trees
............................... 68
2.4
Exercises
............................. 84
3
Binary Search Trees
89
3.1
Searches and Updates
...................... 91
3.2
Range Queries
..........................
Ю1
3.3
Index-Based Searching
..................... 104
3.4
Randomly Constructed Search Trees
.............. 107
3.5
Exercises
.............................
HO
4
Balanced Binary Search Trees
115
4.1
Ranks and Rotations
....................... 117
4.2
AVL Trees
............................. 120
4.3
Red-Black Trees
......................... 126
4.4
Weak AVL Trees
......................... 130
4.5
Splay Trees
............................ 139
4.6
Exercises
............................. 149
5
Priority Queues and Heaps
155
5.1
Priority Queues
.......................... 157
5.2
PQ-Sort, Selection-Sort, and Insertion-Sort
.......... 158
5.3
Heaps
...............................
!63
5.4
Heap-Sort
.............................
I74
5.5
Extending Priority Queues
.................... 179
5.6
Exercises
.............................
I82
v
Contents
vi
6
Hash Tables
M
Maps
...............................
6.2
Hash Functions
..........................
6.3
Handling Collisions and Rehashing
...............198
6.4
Cuckoo Hashing
.........................
206
6.5
Universal Hashing
........................
212
6.6
Exercises
.............................
215
7
Union-Find Structures
7.1
Union-Find and Its Applications
................. 221
7.2
A List-Based Implementation
.................. 225
7.3
A Tree-Based Implementation
.................. 228
7.4
Exercises
.............................
236
Part II
:
Sorting and Selection
8
Merge-Sort and Quick-Sort
241
8.1
Merge-Sort
............................ 243
8.2
Quick-Sort
............................. 250
8.3
A Lower Bound on Comparison-Based Sorting
........ 257
8.4
Exercises
............................. 259
9
Fast Sorting and Selection
265
9.1
Bucket-Sort and Radix-Sort
................... 267
9.2
Selection
............................. 270
9.3
Weighted Medians
........................ 276
9.4
Exercises
............................. 279
Part III: Fundamental Techniques
10
The Greedy Method
283
10.1
The Fractional Knapsack Problem
...............286
10.2
Task Scheduling
.........................289
10.3
Text Compression and Huffman Coding
............292
10.4
Exercises
.............................298
11
Divkto-and-Conquer
303
11.1
Recurrences and the Master Theorem
.............
305
112
Integer Multiplication
................ 313
11.3
Matrix Multiplication
.......................315
11.4
The Maxima-Set Problem
....................317
11.5
Exercises
.............................319
Contents
12 Dynamic Programming 323
12.1 Matrix
Chain-Products
...................... 325
12.2
The General Technique
..................... 329
12.3
Telescope Scheduling......................
331
12.4 Game
Strategies
......................... 334
12.5
The Longest Common Subsequence Problem
......... 339
12.6
The
0-1
Knapsack Problem
................... 343
12.7
Exercises
............................. 346
13
Graphs and
Traversals
353
13.1
Graph Terminology and Representations
............ 355
13.2
Depth-First Search
........................ 365
13.3
Breadth-First Search
....................... 370
13.4
Directed Graphs
......................... 373
13.5
Biconnected Components
.................... 386
13.6
Exercises
............................. 392
Part IV: Graph Algorithms
14
Shortest Paths
397
14.1
Single-Source Shortest Paths
..................399
14.2
Dijkstra s
Algorithm
........................400
14.3
The Bellman-Ford Algorithm
...................407
14.4
Shortest Paths in Directed Acyclic Graphs
...........410
14.5
All-Pairs Shortest Paths
.....................412
14.6
Exercises
.............................418
15
Minimum Spanning Trees
423
15.1
Properties of Minimum Spanning Trees
............425
15.2
Kruskaľs
Algorithm
........................428
15.3
The Prim-Jarnik Algorithm
....................433
15.4
Bardvka s Algorithm
.......................436
15.5
Exercises
.............................439
16
Network Flow and Matching
443
16.1
Flows and Cuts
..........................445
16.2
Maximum Row Algorithms
....................452
16.3
Maximum Bipartite Matching
..................458
16.4
Baseball Elimination
.......................460
16.5
Minimum-Cost Flow
.......................462
16.6
Exercises
.............................469
„.
Contents
fm
Part V: Computational Intractability
17
/VP-Completaness 473
.............................
476
17.2
WP-Compteteness
........................
483
17.3
CNF-Sat and 3SAT
........................
489
17.4
Vertex-Cover, Clique, and Set-Cover
............492
17.5
Subset-Sum and Knapsack
...................496
17.6
Hamiltonian-Cycle and TSP
..................499
17.7
Exercises
.............................
502
18
Approximation Algorithms
507
18.1
The Metric Traveling Salesperson Problem
..........511
18.2
Approximations for Covering Problems
.............515
18.3
Polynomial-Time Approximation Schemes
...........518
18.4
Backtracking and Branch-and-Bound
..............521
18.5
Exercises
.............................525
Part VI: Additional Topics
19
Randomized Algorithms
529
19.1
Generating Random Permutations
............... 531
19.2
Stable Marriages and Coupon Collecting
............ 534
19.3
Minimum Cuts
.......................... 539
19.4
Finding Prime Numbers
..................... 546
19.5
Chemoff Bounds
......................... 551
19.6
Skip
Uste
............................. 557
19.7
Exercises
............................. 563
20
B-Trees and External Memory
569
20.1
External Memory
.........................571
20.2 (2,4)
Trees and B-Trees
.....................574
20.3
External-Memory Sorting
....................590
20.4
OnKne Caching Algorithms
...................593
20.5
Exercises
.............................600
21
Murttdlmensłooal
Searching
603
21.1
Range Trees
...........................605
212
Priority Search Trees
.......................609
21.3
Quadtrees and ib-d Trees
....................614
21.4
Exercises
.............................618
Contents
22
Computational Geometry
623
22.1
Operations on Geometric Objects
................625
22.2
Convex Hulls
...........................630
22.3
Segment Intersection
......................638
22.4
Finding a Closest Pair of Points
.................642
22.5
Exercises
.............................646
23
String Algorithms
651
23.1
String Operations
......................... 653
23.2
The Boyer-Moore Algorithm
................... 656
23.3
The Knuth-Morris-Pratt Algorithm
................ 660
23.4
Hash-Based Lexicon Matching
................. 664
23.5
Tries
................................ 669
23.6
Exercises
............................. 680
24
Cryptography
685
24.1
Greatest Common Divisors (GCD)
...............687
24.2
Modular Arithmetic
........................691
24.3
Cryptographic Operations
....................699
24.4
The RSA Cryptosystem
.....................703
24.5
The El Gamal Cryptosystem
...................706
24.6
Exercises
.............................708
25
The Fast Fourier Transform
711
25.1
Convolution
............................ 713
25.2
Primitive Roots of Unity
..................... 715
25.3
The Discrete Fourier Transform
................. 717
25.4
The Fast Fourier Transform Algorithm
............. 721
25.5
Exercises
............................. 727
26
Linear Programming
731
26.1
Formulating the Problem
.....................734
26.2
The Simplex Method
.......................739
26.3
Duality
...............................746
26.4
Applications of Linear Programming
..............750
26.5
Exercises
.............................753
A Useful Mathematical Facts
761
Bibliography
765
Index
ТГА
|
| any_adam_object | 1 |
| author | Goodrich, Michael T. 1961- Tamassia, Roberto 1960- |
| author_GND | (DE-588)121131181 (DE-588)141557834 |
| author_facet | Goodrich, Michael T. 1961- Tamassia, Roberto 1960- |
| author_role | aut aut |
| author_sort | Goodrich, Michael T. 1961- |
| author_variant | m t g mt mtg r t rt |
| building | Verbundindex |
| bvnumber | BV042291959 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)903584196 (DE-599)GBV787120936 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01628nam a2200397 c 4500</leader><controlfield tag="001">BV042291959</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150224 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">150127s2015 xx a||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2014021534</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118335918</subfield><subfield code="c">hardback</subfield><subfield code="9">978-1-118-33591-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)903584196</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV787120936</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="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-188</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">Goodrich, Michael T.</subfield><subfield code="d">1961-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121131181</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithm design and applications</subfield><subfield code="c">Michael T. Goodrich ; Roberto Tamassia</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ</subfield><subfield code="b">Wiley</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 784 S.</subfield><subfield code="b">Ill., graf. 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="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</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">Entwurf</subfield><subfield code="0">(DE-588)4121208-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Anwendung</subfield><subfield code="0">(DE-588)4196864-5</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">Entwurf</subfield><subfield code="0">(DE-588)4121208-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Anwendung</subfield><subfield code="0">(DE-588)4196864-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tamassia, Roberto</subfield><subfield code="d">1960-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)141557834</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</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=027729108&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027729108</subfield></datafield></record></collection> |
| id | DE-604.BV042291959 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T17:06:58Z |
| institution | BVB |
| isbn | 9781118335918 |
| language | English |
| lccn | 2014021534 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027729108 |
| oclc_num | 903584196 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-573 DE-188 |
| owner_facet | DE-473 DE-BY-UBG DE-573 DE-188 |
| physical | XVI, 784 S. Ill., graf. Darst. |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Wiley |
| record_format | marc |
| spellingShingle | Goodrich, Michael T. 1961- Tamassia, Roberto 1960- Algorithm design and applications Algorithmus (DE-588)4001183-5 gnd Entwurf (DE-588)4121208-3 gnd Anwendung (DE-588)4196864-5 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4121208-3 (DE-588)4196864-5 |
| title | Algorithm design and applications |
| title_auth | Algorithm design and applications |
| title_exact_search | Algorithm design and applications |
| title_full | Algorithm design and applications Michael T. Goodrich ; Roberto Tamassia |
| title_fullStr | Algorithm design and applications Michael T. Goodrich ; Roberto Tamassia |
| title_full_unstemmed | Algorithm design and applications Michael T. Goodrich ; Roberto Tamassia |
| title_short | Algorithm design and applications |
| title_sort | algorithm design and applications |
| topic | Algorithmus (DE-588)4001183-5 gnd Entwurf (DE-588)4121208-3 gnd Anwendung (DE-588)4196864-5 gnd |
| topic_facet | Algorithmus Entwurf Anwendung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027729108&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT goodrichmichaelt algorithmdesignandapplications AT tamassiaroberto algorithmdesignandapplications |