MTL760: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 4: | Line 4: | ||
| credits = 3 | | credits = 3 | ||
| credit_structure = 3-0-0 | | credit_structure = 3-0-0 | ||
| pre_requisites = MTL342 | | pre_requisites = [[MTL342]] | ||
| overlaps = COL758 | | overlaps = [[COL758]] | ||
}} | }} | ||
== MTL760 : Advanced Algorithms == | == MTL760 : Advanced Algorithms == | ||
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. | 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. | ||
Latest revision as of 16:43, 14 April 2026
| MTL760 | |
|---|---|
| Advanced Algorithms | |
| Credits | 3 |
| Structure | 3-0-0 |
| Pre-requisites | MTL342 |
| Overlaps | COL758 |
MTL760 : Advanced Algorithms
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.