Polyteknisk Boghandel

"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.

Algorithm Design Jon Kleinberg and Eva Tardos Table of Contents 1 Introduction: Some Representative Problems
1.
1 A First Problem: Stable Matching
1.
2 Five Representative Problems Solved Exercises Excercises Notes and Further Reading 2 Basics of Algorithms Analysis
2.
1 Computational Tractability
2.
2 Asymptotic Order of Growth Notation
2.
3 Implementing the Stable Matching Algorithm using Lists and Arrays
2.
4 A Survey of Common Running Times
2.
5 A More Complex Data Structure: Priority Queues Solved Exercises Exercises Notes and Further Reading 3 Graphs
3.
1 Basic Definitions and Applications
3.
2 Graph Connectivity and Graph Traversal
3.
3 Implementing Graph Traversal using Queues and Stacks
3.
4 Testing Bipartiteness: An Application of Breadth-First Search
3.
5 Connectivity in Directed Graphs
3.
6 Directed Acyclic Graphs and Topological Ordering Solved Exercises Exercises Notes and Further Reading 4 Greedy Algorithms
4.
1 Interval Scheduling: The Greedy Algorithm Stays Ahead
4.
2 Scheduling to Minimize Lateness: An Exchange Argument
4.
3 Optimal Caching: A More Complex Exchange Argument
4.
4 Shortest Paths in a Graph
4.
5 The Minimum Spanning Tree Problem
4.
6 Implementing Kruskal's Algorithm: The Union-Find Data Structure
4.
7 Clustering
4.
8 Huffman Codes and the Problem of Data Compression *4.
9 Minimum-Cost Arborescences: A Multi-Phase Greedy Algorithm Solved Exercises Excercises Notes and Further Reading