An edition of Algorithm design (1922)

Algorithm design

by and

  • ★★★★★ 5.0 (1 rating)
  • 20 Want to read
  • 3 Have read
Cover of: Algorithm design by Jon Kleinberg, Éva Tardos, Jon Kleinberg
Read

My Reading Lists:

Create a new list
Notes
  • ★★★★★ 5.0 (1 rating)
  • 20 Want to read
  • 3 Have read
Notes

Download Options

Check nearby libraries

Buy this book

Last edited by MARC Bot
November 13, 2025 | History
Edit
An edition of Algorithm design (1922)

Algorithm design

by and

  • ★★★★★ 5.0 (1 rating)
  • 20 Want to read
  • 3 Have read

"Algorithm Design takes a fresh approach to the algorithms course, introducing algorithmic ideas through the real-world problems that motivate them. In a clear, direct style, Jon Kleinberg and Eva Tardos teach students to analyze and define problems for themselves, and from this to recognize which design principles are appropriate for a given situation. The text encourages a greater understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science."--Jacket.

Publish Date
Publisher
Pearson/Addison-Wesley
Language
English
Pages
838

Check nearby libraries

Buy this book

Previews available in: English

Subjects

Computer algorithms, Data structures (Computer science), Algorithmes, Structures de donnees (Informatique), Algoritmen, Datastructuren, Algoritmos e estruturas de dados, Qa76.9.a43 k54 2006, 005.1
Edition Availability
Cover of: Algorithm Design
Algorithm Design
2015, Pearson Education, Limited
in English
Cover of: Algorithm design
Algorithm design
2006, Pearson/Addison-Wesley
in English
Cover of: Algorithm Design
Algorithm Design
March 16, 2005, Addison Wesley
Hardcover in English - United States Ed edition
Cover of: Algorithm Design
Algorithm Design
1922, Pearson Education, Limited
in English

Add another edition?

Book Details

Table of Contents

Introduction: Some representative problems
Basics of algorithms analysis
Graphs
Greedy algorithms
Divide and conquer
Dynamic programming
Network flow
NP and computational intractability
PSPACE: A class of problems beyond NP
Extending the limits of tractability
Approximation algorithms
Local search
Randomized algorithms
Epilogue: algorithms that run forever

Edition Notes

Includes bibliographical references (p. [805]-814) and index

Published in
Boston

Classifications

Library of Congress
QA76.9.A43 K54 2006, QA76.9.A43K54 2005

The Physical Object

Pagination
xxiii, 838 p. :
Number of pages
838

Edition Identifiers

Open Library
OL17188482M
Internet Archive
algorithmdesign00klei_417
ISBN 10
0321295358
LCCN
2005000401
OCLC/WorldCat
57422612
LibraryThing
406822
Goodreads
145055

Work Identifiers

Work ID
OL9166321W

Source records

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Download catalog record: RDF / JSON / OPDS | Wikipedia citation