Course Description
In this course we will go through different paradigms for algorithm
design such
as divide-and-conquer, prune-and-search,
dynamic progamming, greedy strategy
and different analysis techniques with
different data structures. We will apply
these design and analysis techniques to
develop efficient graph and
geometric algorithms.
Book
Introduction to Algorithms (2nd edition) by T. H. Cormen, C. E. Leiserson,
R. Rivest, and C. Stein.
MIT press, McGraw-Hill book company.
pdf files for the slides
(Based on some old notes of Edelsbrunner and mine)
Heapsort
Quicksort
Selection
BinarySearch
DynamicProgramming
Greedy
Algorithm
Amortized
Analysis
Fibonacci Heap1
Fibonacci
Heap2
Union-Find
Graphs (Representation and DFS)
BFS
Topological Sort
Minimum
spanning tree
Shortest path
All pairs shortest path
Network flow
Planar
Graphs
Meeting
DL 713 8:30-9:18 MWF
Office: DL483
Phone:292-3563
Office Hours : MWF 11:30-12:00 or
by appointment
Grading
Homework 30%, Midterm 30% and Final 40%
No late assignment will be accepted
Grader: Chuanjiang Luo, email : luo.75@osu.edu, Office: DL474, phone:
614-292-8578
Office hours : TuFr : 2:15pm--3:15pm