Skip to content

Algorithm Design
Stock Photo: Cover May Be Different

Algorithm Design Hardcover - 2005

by Kleinberg, Jon; Tardos, Eva

  • Used
  • very good
  • first

Description

Pearson. 1. Very Good. Very Good. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported
Used - Very Good
NZ$84.78
FREE Shipping to USA Standard delivery: 7 to 14 days
More Shipping Options
Ships from BooksRun (Pennsylvania, United States)

Details

  • Title Algorithm Design
  • Author Kleinberg, Jon; Tardos, Eva
  • Binding Hardcover
  • Edition 1
  • Condition Used - Very Good
  • Pages 864
  • Volumes 1
  • Language ENG
  • Publisher Pearson, U.S.A
  • Date March 16, 2005
  • Illustrated Yes
  • Bookseller's Inventory # 0321295358-8-1
  • ISBN 9780321295354 / 0321295358
  • Weight 3.85 lbs (1.75 kg)
  • Dimensions 9 x 8.2 x 1.9 in (22.86 x 20.83 x 4.83 cm)
  • Library of Congress subjects Data structures (Computer science), Computer algorithms
  • Library of Congress Catalog Number 2005000401
  • Dewey Decimal Code 005.1

About BooksRun Pennsylvania, United States

Specializing in: Textbooks
Biblio member since 2016
Seller rating: This seller has earned a 4 of 5 Stars rating from Biblio customers.

BooksRun.com - best place to buy, sell or rent cheap textbooks

Terms of Sale: 30 days return guarantee. 10% restocking fee applies to discretionary returns

Browse books from BooksRun

Summary

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

From the publisher

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Table of contents

Table of Contents#1 Introduction : some representative problems 12 Basics of algorithm analysis 293 Graphs 734 Greedy algorithms 1155 Divide and conquer 2096 Dynamic programming 2517 Network flow 3378 NP and computational intractability 4519 PSPACE : a class of problems beyond NP 53110 Extending the limits of tractability 55311 Approximation algorithms 59912 Local search 66113 Randomized algorithms 707 Epilogue : algorithms that run forever 795