Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
1Activity

Table Of Contents

1.4.1 Algorithm
3 SEP 16TH, 2008
2 Sep 11th, 2008
3 Sep 16th, 2008
3.1 Example: Making change
3.2 Example: Scheduling time
3.3 Example: Knapsack problem
5 SEP 23, 2008: DIVIDE AND CONQUER
4 Sep 18, 2008: MISSING
5 Sep 23, 2008: Divide and Conquer
5.1 Solving Recurrence Relations
5.1.1 ”Unrolling” a recurrence
5.1.2 Guess an answer, prove by induction
5.1.3 Changing Variables
5.1.4 Master Theorem
6 Sep 25, 2008
6.1 Assignment Info
6.2 Divide & Conquer Algorithms
6.2.1 Counting Inversions
6.2.2 Multiplying Large Numbers
7 Sep 30, 2008
7.1 D&C: Multiplying Matrices:
7.2 D&C: Closest pair of points
7.3 Hidden Surface Removal
8 Oct 2nd, 2008
8.1 Dynamic Programming
8.2 Second example: optimum binary search trees
9 Oct 7th, 2008
9.1 Example 2: Minimum Weight Triangulation
10 Oct 9th, 2008
10.1 Dynamic Programming
10.2 Certain types of subproblems
10.3 Memoization
11 Oct 14th, 2008
11.1 Graph Algorithms
11.2 Minimum Spanning Trees
12 OCT 16TH, 2008
12 Oct 16th, 2008
12.1 Graph Algorithms
12.1.1 Prim’s Algorithm
12.2 Shortest Paths
13 OCT 21, 2008
13 Oct 21, 2008
13.1 All Pairs Shortest Path
13.1.1 Floyd-Warshall Algorithm
14 OCT 23, 2008
14 Oct 23, 2008
14.1 Dijkstra’s Algorithm
14.2 Connectivity in Graphs
14.2.1 Finding 2-connected components
15 OCT 28TH, 2008
15 Oct 28th, 2008
15.1 Backtracking and Branch/Bound
15.2 Branch-and-Bound
15.2.1 Branch and Bound TSP Algorithm
16 OCT 30TH, 2008
16 Oct 30th, 2008
16.1 Recall
16.2 Lower Bounds
16.2.1 Basic Techniques
16.2.2 State-of-the-Art in Lower Bounds
16.3 Polynomial Time
16.4 Reductions
17 Nov 4th, 2008
17.1 Decision Problems
17.2 P or NP?
17.3 Properties
18 NOV 6TH, 2008
18 Nov 6th, 2008
18.1 Recall
18.2 NP-Complete
18.2.1 Circuit Satisfiability
18.2.2 3-SAT
19 Nov 11th, 2008
19.1 Satisfiability – no restricted form
19.2 Independent Set
19.3 Vertex Cover
19.4 Set-Cover Problem
19.5 Road map of NP-Completeness
19.6 Hamiltonian Cycle
20 NOV 13TH, 2008
20 Nov 13th, 2008
20.1 Undirected Hamiltonian Cycle
20.2 TSP is NP-complete
20.3 Subset-Sum is NP-Complete
21 NOV 18TH, 2008
21 Nov 18th, 2008
21.1 Major Open Questions
21.2 Undecidability
21.2.1 Examples
22 NOV 20TH, 2008
22 Nov 20th, 2008
22.1 Undecidability
22.2 History of Undecidability
23 NOV 25TH, 2008
23 Nov 25th, 2008
23.1 Undecidability
23.2 Other Undecidable Problems
23.2.1 Half-No-Input or Halt-on-Empty
23.2.2 Program Verification
24 NOV 27TH, 2008
23.2.3 Other Problems (no proofs)
24 Nov 27th, 2008
24.1 What to do with NP-complete problems
0 of .
Results for:
No results containing your search query
P. 1
cs341

cs341

Ratings: (0)|Views: 270 |Likes:
Published by AmonRaVij

More info:

Published by: AmonRaVij on Jan 23, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

11/13/2011

pdf

text

original

You're Reading a Free Preview
Pages 6 to 56 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->