The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
About the Book -- The Algorithm Design Manual problem doesn't appear in this book. Equally important is what we do not do in this book. We do not stress the mathematical analysis of algorithms, leaving most of the analysis as informal arguments. You will not find a single theorem anywhere in this book. But what is a manual without software? This book comes with a substantial electronic supplement, a ISO- 9660 compatible, multiplatform CD-ROM, which can be viewed using Netscape, Microsoft Explorer, or any other WWW browser. This CD-ROM contains: ● A complete hypertext version of the full printed book. Indeed, the extensive cross-references within the text are best followed using the hypertext version. ● The source code and URLs for all cited implementations, mirroring the Algorithm Repository WWW site. Programs in C, C++, Fortran, and Pascal are included, providing an average of four different implementations for each algorithmic problem. ● Over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes. Following these lectures provides another approach to learning algorithm design techniques. Together, this book covers material sufficient for a standard Introduction to Algorithms course. Its assumes the reader has completed the equivalent of a second programming course, typically titled Data Structures or Computer Science II . Special textbook oriented-features include: ● In addition to standard pen-and-paper exercises, this book includes ``implementation challenges'' suitable for teams or individual students. These projects and the applied focus of the text can be used to provide a new laboratory focus to the traditional algorithms course. ● ``Take-home lessons'' at the beginning of each chapter emphasize the concepts to be gained from the chapter. ● This book stresses design over analysis. It is suitable for both traditional lecture courses, and the new ``active learning'' method, where the professor does not lecture instead guides student groups to solve real problems. The ``war stories'' provide a great introduction to the active learning method. ● A full set of lecture slides for teaching this course is available on the CD-ROM, keyed to unique on-line audio lectures covering a full semester algorithm course. ``I have no doubt that it will become a classic the day it is published. It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources.'' -- P. Takis Metaxas, Wellesley College. ``A major theme that runs through the book is that the most important technique to solve an algorithmic problem from the real world is to learn how to model the problem well. I did not believe this before; the file:///E|/WEBSITE/INFO/FORM.HTM (2 of 3) [19/1/2003 1:36:48]
About the Book -- The Algorithm Design Manual book did an admirable job of convincing me that there is considerable truth in it.'' -- Giri Narasimhan, The University of Memphis. ``The questions on problem solving are good enough that they ought to be talked about in every programming class in the undergraduate curriculum.'' -- Ron Danielson, Santa Clara University. Check out the preface and table of contents for more information. You may order this book, and are encouraged to do so. You might also be interested in my previous book, Implementing Discrete Mathematics . Please leave your name and address to receive additional information about the book and notification of significant upgrades to this site when they occur. If your WWW client does not support forms, please send an e-mail to algorith@cs.sunysb.edu with your name, e-mail address, and mailing address for further information. First Name: Last Name : E-mail : Company Name : Number and Street : City : State : Zip : Phone : Return to the home page If you have problems with this page, please send E-mail to: algorith@cs.sunysb.edu file:///E|/WEBSITE/INFO/FORM.HTM (3 of 3) [19/1/2003 1:36:48]
- Page 1083 and 1084: About the Ratings About the Ratings
- Page 1085 and 1086: 1.2 Numerical Problems 1.2 Numerica
- Page 1087 and 1088: 1.4 Graph Problems -- polynomial-ti
- Page 1089 and 1090: 1.6 Computational Geometry 1.6 Comp
- Page 1091 and 1092: C++ Language Implementations Algori
- Page 1093 and 1094: C Language Implementations ● POSI
- Page 1095 and 1096: FORTRAN Language Implementations Al
- Page 1097 and 1098: Lisp Language Implementations Algor
- Page 1099 and 1100: Algorithm Repository -- Citations C
- Page 1101 and 1102: Practical Algorithm Design -- User
- Page 1103 and 1104: LEDA - A Library of Efficient Data
- Page 1105 and 1106: Discrete Optimization Methods Discr
- Page 1107 and 1108: Netlib / TOMS -- Collected Algorith
- Page 1109 and 1110: Netlib / TOMS -- Collected Algorith
- Page 1111 and 1112: Xtango and Polka Algorithm Animatio
- Page 1113 and 1114: Combinatorica Combinatorica Combina
- Page 1115 and 1116: file:///E|/WEBSITE/IMPLEMEN/GRAPHBA
- Page 1117 and 1118: 1.4.1 Connected Components 1.4.1 Co
- Page 1119 and 1120: 1.5.9 Graph Isomorphism 1.5.9 Graph
- Page 1121 and 1122: 1.2.3 Matrix Multiplication 1.2.3 M
- Page 1123 and 1124: 1.6.14 Motion Planning 1.6.14 Motio
- Page 1125 and 1126: 1.4.9 Network Flow 1.4.9 Network Fl
- Page 1127 and 1128: 1.1.2 Priority Queues 1.1.2 Priorit
- Page 1129 and 1130: 1.5.10 Steiner Tree 1.5.10 Steiner
- Page 1131 and 1132: 1.4.5 Transitive Closure and Reduct
- Page 1133: About the Book -- The Algorithm Des
- Page 1137 and 1138: Genocop -- Optimization via Genetic
- Page 1139 and 1140: 1.2.6 Linear Programming ● Knapsa
- Page 1141 and 1142: 1.2.7 Random Number Generation ●
- Page 1143 and 1144: 1.3.10 Satisfiability ● Constrain
- Page 1145 and 1146: Qhull - higher dimensional convex h
- Page 1147 and 1148: 1.6.5 Nearest Neighbor Search 1.6.5
- Page 1149 and 1150: 1.6.7 Point Location 1.6.7 Point Lo
- Page 1151 and 1152: 1.6.10 Medial-Axis Transformation 1
- Page 1153 and 1154: 1.6.3 Triangulation 1.6.3 Triangula
- Page 1155 and 1156: Nijenhuis and Wilf: Combinatorial A
- Page 1157 and 1158: 1.5.5 Hamiltonian Cycle 1.5.5 Hamil
- Page 1159 and 1160: 1.4.6 Matching 1.4.6 Matching INPUT
- Page 1161 and 1162: A compendium of NP optimization pro
- Page 1163 and 1164: 1.6.9 Bin Packing 1.6.9 Bin Packing
- Page 1165 and 1166: 1.6.12 Simplifying Polygons 1.6.12
- Page 1167 and 1168: 1.6.13 Shape Similarity 1.6.13 Shap
- Page 1169 and 1170: 1.6.11 Polygon Partitioning 1.6.11
- Page 1171 and 1172: 1.4.3 Minimum Spanning Tree 1.4.3 M
- Page 1173 and 1174: 1.6.15 Maintaining Line Arrangement
- Page 1175 and 1176: 1.3.7 Generating Graphs 1.3.7 Gener
- Page 1177 and 1178: 1.2.11 Discrete Fourier Transform 1
- Page 1179 and 1180: 1.5.8 Edge Coloring 1.5.8 Edge Colo
- Page 1181 and 1182: 1.3.3 Median and Selection 1.3.3 Me
- Page 1183 and 1184: 1.3.1 Sorting 1.3.1 Sorting INPUT O
About the Book -- <strong>The</strong> <strong>Algorithm</strong> <strong>Design</strong> <strong>Manual</strong><br />
problem doesn't appear in this book.<br />
Equally important is what we do not do in this book. We do not stress the mathematical analysis of<br />
algorithms, leaving most of the analysis as informal arguments. You will not find a single theorem<br />
anywhere in this book.<br />
But what is a manual without software? This book comes with a substantial electronic supplement, a ISO-<br />
9660 compatible, multiplatform CD-ROM, which can be viewed using Netscape, Microsoft Explorer, or<br />
any other WWW browser. This CD-ROM contains:<br />
● A complete hypertext version of the full printed book. Indeed, the extensive cross-references<br />
within the text are best followed using the hypertext version.<br />
● <strong>The</strong> source code and URLs for all cited implementations, mirroring the <strong>Algorithm</strong> Repository<br />
WWW site. Programs in C, C++, Fortran, and Pascal are included, providing an average of four<br />
different implementations for each algorithmic problem.<br />
● Over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to<br />
on-line lecture notes. Following these lectures provides another approach to learning algorithm<br />
design techniques.<br />
Together, this book covers material sufficient for a standard Introduction to <strong>Algorithm</strong>s course. Its<br />
assumes the reader has completed the equivalent of a second programming course, typically titled Data<br />
Structures or Computer Science II . Special textbook oriented-features include:<br />
● In addition to standard pen-and-paper exercises, this book includes ``implementation challenges''<br />
suitable for teams or individual students. <strong>The</strong>se projects and the applied focus of the text can be<br />
used to provide a new laboratory focus to the traditional algorithms course.<br />
● ``Take-home lessons'' at the beginning of each chapter emphasize the concepts to be gained from<br />
the chapter.<br />
● This book stresses design over analysis. It is suitable for both traditional lecture courses, and the<br />
new ``active learning'' method, where the professor does not lecture instead guides student groups<br />
to solve real problems. <strong>The</strong> ``war stories'' provide a great introduction to the active learning<br />
method.<br />
● A full set of lecture slides for teaching this course is available on the CD-ROM, keyed to unique<br />
on-line audio lectures covering a full semester algorithm course.<br />
``I have no doubt that it will become a classic the day it is published. It has all the right ingredients: rich<br />
contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to<br />
resources.''<br />
-- P. Takis Metaxas, Wellesley College.<br />
``A major theme that runs through the book is that the most important technique to solve an algorithmic<br />
problem from the real world is to learn how to model the problem well. I did not believe this before; the<br />
file:///E|/WEBSITE/INFO/FORM.HTM (2 of 3) [19/1/2003 1:36:48]