Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

Introduction
1.1 Topics to be covered
1.2 On Algorithms
1.3 Computing the nth Fibonacci Number
1.4 Algorithm Design Paradigms
1.5 Maximum/minimum
1.6 Integer Multiplication
1.7 Solving Divide-and Conquer Recurrences
Graph Algorithms
2.1 Introduction
2.2 Reasoning about Graphs
2.3 Data Structures for Graphs
Depth First Search
3.1 Depth-First Search
3.2 Applications of Depth-First Searching
3.3 Depth-ﬁrst Search in Directed Graphs
3.4 Directed Acyclic Graphs
3.5 Strongly Connected Components
Strongly Connected Components
Breadth First Search and Shortest
4.2 Dijkstra’s Algorithm
4.2.1 What is the complexity of Dijkstra’s algorithm?
4.2.2 Why does Dijkstra’s algorithm work?
4.3 Negative Weights—Bellman-Ford Algorithm
4.4 Negative Cycles
Minimum Spanning Trees
5.1 Minimum Spanning Trees
5.2 Prim’s algorithm:
5.3 Kruskal’s algorithm
5.4 Exchange Property
6.2 Universal Hashing
6.3 Hashing with 2-Universal Families
A Randomized Min Cut Algorithm
7.1 Min Cut
7.2 The Contract Algorithms
7.2.1 Algorithm
7.2.2 Analysis
Union-Find Data Structures
8.1 Disjoint Set Union-Find
8.2 Analysis of Union-Find
Dynamic Programming
9.1 Introduction to Dynamic Programming
9.2 String Reconstruction
9.3 Edit Distance
9.3.1 Deﬁnition
9.3.2 Computing Edit Distance
9.4 Longest Common Subsequence
9.5 Chain Matrix Multiplication
9.6 Knapsack
9.7 All-Pairs-Shortest-Paths
Data Compression
10.1 Data Compression via Huﬀman Coding
10.2 The Lempel-Ziv algorithm
10.3 Lower bounds on data compression
10.3.1 Simple Results
10.3.2 Introduction to Entropy
10.3.3 A Calculation
Linear Programming
11.1 Linear Programming
11.2 Introductory example in 2D
11.3 Introductory Example in 3D
11.4 Algorithms for Linear Programming
11.5 Diﬀerent Ways to Formulate a Linear Programming
11.6 A Production Scheduling Example
11.7 A Communication Network Problem
Flows and Matchings
12.1 Network Flows
12.1.1 The problem
12.1.2 The Ford-Fulkerson Algorithm
12.1.3 Analysis of the Ford-Fulkerson Algorithm
12.2 Duality
12.3 Matching
12.3.1 Deﬁnitions
12.3.2 Reduction to Maximum Flow
12.3.3 Direct Algorithm
13.1 Tractable and Intractable Problems
13.2 Decision Problems
13.4 Deﬁnition of Some Problems
13.5 NP, NP-completeness
13.6 NP-completeness of Circuit-SAT
13.7 Proving More NP-completeness Results
13.8 NP-completeness of SAT
13.9 NP-completeness of 3SAT
13.10 Some NP-complete Graph Problems
13.10.1 Independent Set
13.10.2 Maximum Clique
13.10.3 Minimum Vertex Cover
13.11 Some NP-complete Numerical Problems
13.11.1 Subset Sum
13.11.2 Partition
13.11.3 Bin Packing
13.12 Approximating NP-Complete Problems
13.12.1 Approximating Vertex Cover
13.12.2 Approximating TSP
13.12.3 Approximating Max Clique
0 of .
Results for:
P. 1
Berkeley

Berkeley

Ratings: (0)|Views: 208|Likes:

Published by: kskumar84 on Oct 11, 2010

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
See more
See less

05/24/2012

pdf

text

original

You're Reading a Free Preview
Pages 4 to 40 are not shown in this preview.
You're Reading a Free Preview
Pages 44 to 95 are not shown in this preview.
You're Reading a Free Preview
Pages 99 to 113 are not shown in this preview.

Activity (2)

You've already reviewed this. Edit your review.