Jump to content

MTL760

From IITD Wiki
Revision as of 10:14, 4 March 2026 by Prashantt492 (talk | contribs) (Creating course page via bot)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
MTL760
Advanced Algorithms
Credits 3
Structure 3-0-0
Pre-requisites MTL342
Overlaps COL758

MTL760 : Advanced Algorithms

[edit]

MST: Fibonacci Heaps and O(m log log n) time implementation of MST, Linear time MST verification Algorithm, A linear time randomized algorithm for MST,Finding min-cost arborescences; Dynamic Graph Algorithms; Review of NP-completeness; Introduction to NP-hard optimization problems; A brief introduction to LPP; Integer Programming Problem; Primal-Dual Algorithm; Approximation Algorithms: Primal-Dual Approximation Scheme; vertex cover, set cover, TSP; Hardness of Approximation; Introduction to Randomized Algorithms; Some basic Randomized algorithms; Probabilistic Method: Lovasz Local Lemma.