CSE503 Advanced Algorithmic Analysis L T P C

3 0 2 4
Version No. : 2.00

Course
Prerequisites:
Objective
To focus on design and analysis of algorithms in various domains that lays foundations for
designing efficient algorithms.
Expected Outcome
On completion of this course the student would be able to
- Apply the algorithms and design techniques to solve problems
- Have a sense of the complexities of various problems in different domains.
Unit No. I Introduction 9 hours
Overview of algorithmic design, asymptotic notation and its properties, Growth of Functions,
Time complexity and Analysis of algorithms, Recurrence Relations, Amortized analysis.
Unit No. II Linear Programming 9 hours
Geometry, Farkas' Lemma, Strong Duality, Complexity, Interior-point Algorithms, Ellipsoid
Algorithm and Optimization vs. Separation, Extension to Conic Programming.

Unit No. III Network Flows 9 hours

Maximum Flows, Min-cost Flows, Cycle Cancelling Algorithms, Strongly Polynomial-time
Analysis, Minimum Cuts without Flows

Unit No. IV P and NP Classes 9 hours

Class P, Polynomial time verification, reducibility, NP-Hard, NP-completeness, Cooks theorem,
NP-complete problems− Circuitsat, 3Sat-CNF, Clique, vertex-cover and subset sum.

Unit No. V Approximation Algorithms 9 hours

Limits to Approximability, Basic Techniques and Vertex Cover, Primal-dual Technique, Set
cover problem,Multicommodity Cut via Embedding Metric Spaces, Approximation Scheme for
Euclidean TSP
Text / Reference Books
1. Cormen, Leiserson, Rivest and Stein, “Introduction to Algorithms”, 3rd edition, McGraw-
Hill, 2009.
2. E. Horowitz, and S. Sahni, “Fundamentals of Computer Algorithms”, 2nd edition, Computer
Science Press, 2008.
3. Schrijver, A. “Theory of Linear and Integer Programming” Chichester: John Wiley & Sons,
1998.
4. Roos, C., T. Terlaky, and J. -Ph. Vial. “Theory and Algorithms for Linear Optimization: An
Interior Point Approach” Chichester: John Wiley & Sons, 1997.
5. Vazirani, V. “Approximation Algorithms” Berlin: Springer-Verlag, 2001.

Mode of Evaluation : Tests, Assignments and Seminar.

Recommended by the Board of Studies on:

Proceedings of the 29th Academic Council [26.4.2013] 402