Coverart for item
The Resource Algorithm design, Jon Kleinberg, Éva Tardos

Algorithm design, Jon Kleinberg, Éva Tardos

Label
Algorithm design
Title
Algorithm design
Statement of responsibility
Jon Kleinberg, Éva Tardos
Creator
Contributor
Subject
Language
eng
Summary
"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
Cataloging source
DLC
http://library.link/vocab/creatorName
Kleinberg, Jon M
Illustrations
illustrations
Index
index present
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
Tardos, Éva
http://library.link/vocab/subjectName
  • Computer algorithms
  • Data structures (Computer science)
Label
Algorithm design, Jon Kleinberg, Éva Tardos
Instantiates
Publication
Note
"Pearson international edition" -- cover
Bibliography note
Includes bibliographical references (p. [805]-814) and index
Contents
  • 1.
  • Introduction : some representative problems.
  • p. 1
  • 2.
  • Basics of algorithm analysis.
  • p. 29
  • 3.
  • Graphs.
  • p. 73
  • 4.
  • Greedy algorithms.
  • p. 115
  • 5.
  • Divide and conquer.
  • p. 209
  • 6.
  • Dynamic programming.
  • p. 251
  • 7.
  • Network flow.
  • p. 337
  • 8.
  • NP and computational intractability.
  • p. 451
  • 9.
  • PSPACE : a class of problems beyond NP.
  • p. 531
  • 10.
  • Extending the limits of tractability.
  • p. 553
  • 11.
  • Approximation algorithms.
  • p. 599
  • 12.
  • Local search.
  • p. 661
  • 13.
  • Randomized algorithms.
  • p. 707
  • Epilogue : algorithms that run forever.
  • p. 795
Control code
l70015888861
Dimensions
24 cm.
Extent
xxiii, 838 p
Isbn
9780321295354
Lccn
2005000401
Other physical details
ill
Label
Algorithm design, Jon Kleinberg, Éva Tardos
Publication
Note
"Pearson international edition" -- cover
Bibliography note
Includes bibliographical references (p. [805]-814) and index
Contents
  • 1.
  • Introduction : some representative problems.
  • p. 1
  • 2.
  • Basics of algorithm analysis.
  • p. 29
  • 3.
  • Graphs.
  • p. 73
  • 4.
  • Greedy algorithms.
  • p. 115
  • 5.
  • Divide and conquer.
  • p. 209
  • 6.
  • Dynamic programming.
  • p. 251
  • 7.
  • Network flow.
  • p. 337
  • 8.
  • NP and computational intractability.
  • p. 451
  • 9.
  • PSPACE : a class of problems beyond NP.
  • p. 531
  • 10.
  • Extending the limits of tractability.
  • p. 553
  • 11.
  • Approximation algorithms.
  • p. 599
  • 12.
  • Local search.
  • p. 661
  • 13.
  • Randomized algorithms.
  • p. 707
  • Epilogue : algorithms that run forever.
  • p. 795
Control code
l70015888861
Dimensions
24 cm.
Extent
xxiii, 838 p
Isbn
9780321295354
Lccn
2005000401
Other physical details
ill

Library Locations

    • Harold Cohen LibraryBorrow it
      Ashton Street, Liverpool, L69 3DA, GB
      53.418074 -2.967913
Processing Feedback ...