MA 5012 Approximation Algorithms
Course
contents: Complexity of optimization Problems: Design Techniques for Approximation Algorithms:
Approximation Classes:
Approximation algorithms for various problems:
Text Books: 1.
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, 1999. References: 1.
V. Vazirani, Approximation Algorithms, Springer 2005. (indian edition available)
2.
C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization: Algorithms and Complexity, PHI 2001.
3.
J. Kleinberg and E. Tardos, Algorithm Design, Pearson India, 2007.
