https://wiki.devclub.in/index.php?action=history&feed=atom&title=MTL760 2026-04-09T07:49:03Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=MTL760&diff=1653&oldid=prev 2026-03-04T10:14:53Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = MTL760<br /> | name = Advanced Algorithms<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = MTL342<br /> | overlaps = COL758<br /> }}<br /> <br /> == MTL760 : Advanced Algorithms ==<br /> 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.</div>

Prashantt492