The Algorithm Design Manual / Edition 2

The Algorithm Design Manual / Edition 2

by Steven S Skiena
ISBN-10:
1849967202
ISBN-13:
9781849967204
Pub. Date:
11/05/2010
Publisher:
Springer London
ISBN-10:
1849967202
ISBN-13:
9781849967204
Pub. Date:
11/05/2010
Publisher:
Springer London
The Algorithm Design Manual / Edition 2

The Algorithm Design Manual / Edition 2

by Steven S Skiena
$79.99
Current price is , Original price is $79.99. You
$79.99 
  • SHIP THIS ITEM
    Temporarily Out of Stock Online
  • PICK UP IN STORE

    Your local store may have stock of this item.

  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.


Overview

Expanding on the highly successful formula of the first edition, this book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms.


Product Details

ISBN-13: 9781849967204
Publisher: Springer London
Publication date: 11/05/2010
Edition description: 2nd ed. 2008
Pages: 730
Product dimensions: 6.90(w) x 9.20(h) x 1.70(d)

About the Author

Steven Skiena is Professor of Computer Science at Stony Brook University. His research interests include the design of graph, string, and geometric algorithms, and their applications (particularly to biology). He is the author of four books, including "The Algorithm Design Manual" and "Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win". He is recipient of the ONR Young Investigator Award and the IEEE Computer Science and Engineering Undergraduate Teaching Award.

Table of Contents

Part I: Practical Algorithm Design. Introduction to Algorithms. Algorithm Analysis. Data Structures. Sorting and Searching. Graph Traversal. Weighted Graph Algorithms. Combinatorial Search and Heuristic Methods. Dynamic Programming. Intractable Problems and Approximations. How to Design Algorithms.- Part II: The Hitchhiker's Guide to Algorithms. A Catalog of Algorithmic Problems. Data Structures. Numerical Problems. Combinatorical Problems. Graph Problems: Polynomial-Time. Graph Problems: Hard Problems. Computational Geometry. Set and String Problems. Algorithmic Resources.- Bibliography.- Index.

From the B&N Reads Blog

Customer Reviews