Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Algorithm Design: A Methodological Approach - 150 problems and detailed solutions - Patrick Bosc, Marc Guyomard, Laurent Miclet

Algorithm Design: A Methodological Approach - 150 problems and detailed solutions

Buch | Softcover
808 Seiten
2023
Chapman & Hall/CRC (Verlag)
978-1-032-36939-6 (ISBN)
CHF 81,95 inkl. MwSt
A best-seller in its French edition, this book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed at.
A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. (2) For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. (3) For the most part, the book details 150 problems, spanning seven families of algorithms. For each problem, a precise and progressive statement is given. More importantly, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed out. Roughly speaking, two-thirds of the book is devoted to the detailed rational construction of the solutions.

Patrick Bosc, Marc Guyomard, and Laurent Miclet are former professors at Enssat, Engineering school of University of Rennes, France and senior researchers at IRISA. They have taught Data Structures, Algorithmic, Databases, Formal methods, Language theory, Compiling, etc. for numerous years at the Bachelor and Master levels.

Table of Contents

Preface






Mathematics and Computer Science: Some Useful Notions



Complexity of an Algorithm



Specifications, Invariants, Iteration



Reduce and Conquer, Recursion



Generate and Test



Branch and Bound



Greedy Algorithms



Divide and Conquer



Dynamic Programming

Notations

List of Problems

Bibliography

Index

Erscheinungsdatum
Zusatzinfo 197 Tables, black and white; 260 Line drawings, black and white; 260 Illustrations, black and white
Sprache englisch
Maße 178 x 254 mm
Gewicht 1515 g
Themenwelt Mathematik / Informatik Informatik Programmiersprachen / -werkzeuge
Mathematik / Informatik Informatik Software Entwicklung
Informatik Theorie / Studium Algorithmen
ISBN-10 1-032-36939-6 / 1032369396
ISBN-13 978-1-032-36939-6 / 9781032369396
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15