|
" Algorithm design / "
Jon Kleinberg, Éva Tardos
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
654540
|
| Doc. No
|
:
|
dltt
|
| Main Entry
|
:
|
Kleinberg, Jon
|
| Title & Author
|
:
|
Algorithm design /\ Jon Kleinberg, Éva Tardos
|
| Publication Statement
|
:
|
Boston :: Pearson/Addison-Wesley,, c2006
|
| Page. NO
|
:
|
xxiii, 838 p. :: ill. ;; 24 cm
|
| ISBN
|
:
|
0321295358 (alk. paper)
|
|
|
:
|
: 9780321295354 (alk. paper)
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references (p. [805]-814) and index
|
| 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
|
| Abstract
|
:
|
"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."--BOOK JACKET
|
| Subject
|
:
|
Computer algorithms
|
| Subject
|
:
|
Data structures (Computer science)
|
| Dewey Classification
|
:
|
005.1
|
| LC Classification
|
:
|
QA76.9.A43K54 2006
|
| Added Entry
|
:
|
Tardos, Éva
|
| |