Generalization and Specialization of Kernelization Daniel Lokshtanov.
NP-Completeness: Reductions CSc 4520/6520 Fall 2013 Slides adapted from David Evans (Virgina) and Costas Busch (RPI)
Vertex-Cover Inapproximability Irit Dinur NEC, Princeton Based on joint work with Muli Safra.
Approximation Algorithm: Iterative Rounding Lecture 15: March 9.
1 Algorithm Design Patterns and Anti-Patterns Algorithm design patterns.Ex. n Greed.O(n log n) interval scheduling. n Divide-and-conquer. O(n log n) FFT.
Advanced Algorithms Piyush Kumar (Lecture 7: Reductions) Welcome to COT5405 Based on Kevin Wayne’s slides.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
1 Introduction to Approximation Algorithms Lecture 15: Mar 5.
