Algorithm Design: Foundations, Analysis, and Internet Examples / Edition 1

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $28.49
Usually ships in 1-2 business days
(Save 82%)
Other sellers (Paperback)
  • All (14) from $28.49   
  • New (5) from $105.06   
  • Used (9) from $28.49   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$105.06
Seller since 2010

Feedback rating:

(3)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
2001 Paperback A new copy of this book In stock and despatched from the UK. NB: All orders from the USA and Canada have to be sent via the Alibris depot in the UK and are then ... sent to the customer by Alibris in the USA. Until the book is received in the USA Alibris warehouse your order will show as Pending. Expected delivery dates are contained in the Help section of this site and in the confirmation email. *****PLEASE NOTE: This item is shipping from an authorized seller in Europe. In the event that a return is necessary, you will be able to return your item within the US. To learn more about our European sellers and policies see the BookQuest FAQ section***** Read more Show Less

Ships from: Glasgow, United Kingdom

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
$158.92
Seller since 2009

Feedback rating:

(10232)

Condition: New
New Book. Shipped from US within 4 to 14 business days. Established seller since 2000

Ships from: Secaucus, NJ

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$163.42
Seller since 2008

Feedback rating:

(4462)

Condition: New
New Book. Shipped from UK within 4 to 14 business days. Established seller since 2000.

Ships from: Horcott Rd, Fairford, United Kingdom

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$179.73
Seller since 2008

Feedback rating:

(17547)

Condition: New
Brand New, Perfect Condition, Please allow 4-14 business days for delivery. 100% Money Back Guarantee, Over 1,000,000 customers served.

Ships from: Westminster, MD

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
$215.33
Seller since 2009

Feedback rating:

(93)

Condition: New
PAPERBACK New 0471383651 Special order direct from the distributor.

Ships from: Victoria, Canada

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

Overview

Michael Goodrich and Roberto Tamassia, authors of the successful, Data Structures and Algorithms in Java, 2/e, have written Algorithm Engineering, a text designed to provide a comprehensive introduction to the design, implementation and analysis of computer algorithms and data structures from a modern perspective. This book offers theoretical analysis techniques as well as algorithmic design patterns and experimental methods for the engineering of algorithms.
Market: Computer Scientists; Programmers.
Read More Show Less

Product Details

  • ISBN-13: 9780471383659
  • Publisher: Wiley
  • Publication date: 10/15/2001
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 720
  • Product dimensions: 7.50 (w) x 9.25 (h) x 1.47 (d)

Table of Contents

I Fundamental Tools 1

1 Algorithm Analysis 3

1.1 Methodologies for Analyzing Algorithms 5

1.2 Asymptotic Notation 13

1.3 A Quick Mathematical Review 21

1.4 Case Studies in Algorithm Analysis 31

1.5 Amortization 34

1.6 Experimentation 42

1.7 Exercises 47

2 Basic Data Structures 55

2.1 Stack sand Queues 57

2.2 Vectors, Lists, and Sequences 65

2.3 Trees 75

2.4 Priority Queues and Heaps 94

2.5 Dictionaries and Hash Tables 114

2.6 Java Example: Heap 128

2.7 Exercises 131

3 Search Trees and Skip Lists 139

3.1 Ordered Dictionaries and Binary Search Trees 141

3.2 AVL Trees 152

3.3 Bounded-Depth Search Trees 159

3.4 Splay Trees 185

3.5 Sk i p Lists 195

3.6 Java Example: AVL and Red-Black Trees 202

3.7 Exercises 212

4 Sorting, Sets, and Selection 217

4.1 Merge-Sort 219

4.2 The Set Abstract Data Type 225

4.3 Quick -Sort 235

4.4 A Lower Bound on Comparison-Based Sorting 239

4.5 Buck et-Sort and Radix-Sort 241

4.6 Comparison of Sorting Algorithms 244

4.7 Selection 245

4.8 Java Example: In-Place Quick -Sort 248

4.9 Exercises 251

5 Fundamental Techniques 257

5.1 The GreedyMethod 259

5.2 Divide-and-Conquer 263

5.3 Dynamic Programming 274

5.4 Exercises 282

II Graph Algorithms 285

6 Graphs 287

6.1 The Graph Abstract Data Type 289

6.2 Data Structures for Graphs 296

6.3 Graph Traversal 303

6.4 Directed Graphs 316

6.5 Java Example: Depth-First Search 329

6.6 Exercises 335

7 Weighted Graphs 339

7.1 Single-Source Shortest Paths 341

7.2 All-Pairs Shortest Paths 354

7.3 Minimum Spanning Trees 360

7.4 Java Example: Dijk stra’s Algorithm 373

7.5 Exercises 376

8 Network Flow and Matching 381

8.1 Flows and Cuts 383

8.2 Maximum Flow 387

8.3 Maximum BipartiteMatching 396

8.4 Minimum-Cost Flow 398

8.5 Java Example: Minimum-Cost Flow 405

8.6 Exercises 412

III Internet Algorithmics 415

9 Text Processing 417

9.1 Strings and PatternMatching Algorithms 419

9.2 Tries 429

9.3 Text Compression 440

9.4 Text Similarity Testing 443

9.5 Exercises 447

10 Number Theory and Cryptography 451

10.1 Fundamental Algorithms Involving Numbers 453

10.2 Cryptographic Computations 471

10.3 Information Security Algorithms and Protocols 481

10.4 The Fast Fourier Transform 488

10.5 Java Example: FFT 500

10.6 Exercises 508

11 Network Algorithms 511

11.1 ComplexityMeasures and Models 513

11.2 Fundamental Distributed Algorithms 517

11.3 Broadcast and Unicast Routing 530

11.4 Multicast Routing 535

11.5 Exercises 541

IV Additional Topics 545

12 Computational Geometry 547

12.1 Range Trees 549

12.2 Priority Search Trees 556

12.3 Quadtrees and k-D Trees 561

12.4 The Plane Sweep Technique 565

12.5 Convex Hulls 572

12.6 Java Example: Convex Hull 583

12.7 Exercises 587

13 NP-Completeness 591

13.1 P and NP 593

13.2 NP-Completeness 599

13.3 Important NP-Complete Problems 603

13.4 Approximation Algorithms 618

13.5 Back track i ng and Branch-and-Bound 627

13.6 Exercises 638

14 Algorithmic Frameworks 643

14.1 External-Memory Algorithms 645

14.2 Parallel Algorithms 657

14.3 Online Algorithms 667

14.4 Exercises 680

A Useful Mathematical Facts 685

Bibliography 689

Index 698

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)