Algorithm Design

ISBN-10: 0321295358

ISBN-13: 9780321295354

Edition: 2006

List price: $176.20
eBook available
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description:

Algorithm Designintroduces algorithms by looking at the real-world problems that motivate them. The book teachesnbsp;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.
eBooks Starting from $34.99
Rent eBooks
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Italian Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
Portuguese Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
Spanish Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
German Grammar Online content $4.95 $1.99
Customers also bought
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $176.20
Copyright year: 2006
Publisher: Addison Wesley
Publication date: 3/16/2005
Binding: Paperback
Pages: 864
Size: 8.00" wide x 9.00" long x 1.25" tall
Weight: 3.542
Language: English

About the Authors
Preface
Introduction: Some Representative Problems
A First Problem: Stable Matching
Five Representative Problems
Solved Exercises
Exercises
Notes and Further Reading
Basics of Algorithm Analysis
Computational Tractability
Asymptotic Order of Growth
Implementing the Stable Matching Algorithm Using Lists and Arrays
A Survey of Common Running Times
A More Complex Data Structure: Priority Queues
Solved Exercises
Exercises
Notes and Further Reading
Graphs
Basic Definitions and Applications
Graph Connectivity and Graph Traversal
Implementing Graph Traversal Using Queues and Stacks
Testing Bipartiteness: An Application of Breadth-First Search
Connectivity in Directed Graphs
Directed Acyclic Graphs and Topological Ordering
Solved Exercises
Exercises
Notes and Further Reading
Greedy Algorithms
Interval Scheduling: The Greedy Algorithm Stays Ahead
Scheduling to Minimize Lateness: An Exchange Argument
Optimal Caching: A More Complex Exchange Argument
Shortest Paths in a Graph
The Minimum Spanning Tree Problem
Implementing Kruskal's Algorithm: The Union-Find Data Structure
Clustering
Huffman Codes and Data Compression
Minimum-Cost Arborescences: A Multi-Phase Greedy Algorithm
Solved Exercises
Exercises
Notes and Further Reading
Divide and Conquer
A First Recurrence: The Mergesort Algorithm
Further Recurrence Relations
Counting Inversions
Finding the Closest Pair of Points
Integer Multiplication
Convolutions and the Fast Fourier Transform
Solved Exercises
Exercises
Notes and Further Reading
Dynamic Programming
Weighted Interval Scheduling: A Recursive Procedure
Principles of Dynamic Programming: Memoization or Iteration over Subproblems
Segmented Least Squares: Multi-way Choices
Subset Sums and Knapsacks: Adding a Variable
RNA Secondary Structure: Dynamic Programming over Intervals
Sequence Alignment
Sequence Alignment in Linear Space via Divide and Conquer
Shortest Paths in a Graph
Shortest Paths and Distance Vector Protocols
Negative Cycles in a Graph
Solved Exercises
Exercises
Notes and Further Reading
Network Flow
The Maximum-Flow Problem and the Ford-Fulkerson Algorithm
Maximum Flows and Minimum Cuts in a Network
Choosing Good Augmenting Paths
The Preflow-Push Maximum-Flow Algorithm
A First Application: The Bipartite Matching Problem
Disjoint Paths in Directed and Undirected Graphs
Extensions to the Maximum-Flow Problem
Survey Design
Airline Scheduling
Image Segmentation
Project Selection
Baseball Elimination
A Further Direction: Adding Costs to the Matching Problem
Solved Exercises
Exercises
Notes and Further Reading
NP and Computational Intractability
Polynomial-Time Reductions
Reductions via "Gadgets": The Satisfiability Problem
Efficient Certification and the Definition of NP
NP-Complete Problems
Sequencing Problems
Partitioning Problems
Graph Coloring
Numerical Problems
Co-NP and the Asymmetry of NP
A Partial Taxonomy of Hard Problems
Solved Exercises
Exercises
Notes and Further Reading
PSPACE: A Class of Problems beyond NP
PSPACE
Some Hard Problems in PSPACE
Solving Quantified Problems and Games in Polynomial Space
Solving the Planning Problem in Polynomial Space
Proving Problems PSPACE-Complete
Solved Exercises
Exercises
Notes and Further Reading
Extending the Limits of Tractability
Finding Small Vertex Covers
Solving NP-Hard Problems on Trees
Coloring a Set of Circular Arcs
Tree Decompositions of Graphs
Constructing a Tree Decomposition
Solved Exercises
Exercises
Notes and Further Reading
Approximation Algorithms
Greedy Algorithms and Bounds on the Optimum: A Load Balancing Problem
The Center Selection Problem
Set Cover: A General Greedy Heuristic
The Pricing Method: Vertex Cover
Maximization via the Pricing Method: The Disjoint Paths Problem
Linear Programming and Rounding: An Application to Vertex Cover
Load Balancing Revisited: A More Advanced LP Application
Arbitrarily Good Approximations: The Knapsack Problem
Solved Exercises
Exercises
Notes and Further Reading
Local Search
The Landscape of an Optimization Problem
The Metropolis Algorithm and Simulated Annealing
An Application of Local Search to Hopfield Neural Networks
Maximum-Cut Approximation via Local Search
Choosing a Neighbor Relation
Classification via Local Search
Best-Response Dynamics and Nash Equilibria
Solved Exercises
Exercises
Notes and Further Reading
Randomized Algorithms
A First Application: Contention Resolution
Finding the Global Minimum Cut
Random Variables and Their Expectations
A Randomized Approximation Algorithm for MAX 3-SAT
Randomized Divide and Conquer: Median-Finding and Quicksort
Hashing: A Randomized Implementation of Dictionaries
Finding the Closest Pair of Points: A Randomized Approach
Randomized Caching
Chernoff Bounds
Load Balancing
Packet Routing
Background: Some Basic Probability Definitions
Solved Exercises
Exercises
Notes and Further Reading
Epilogue: Algorithms That Run Forever
References
Index
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×