What We Cover(continued) 3. Introduction to computational complexity NP-complete problems 4. Approximation algorithms Vertex cover Steiner trees Traveling sales man problem Page l1 2021/26 CS4335 Design and Analysis of2021/1/26 CS4335 Design and Analysis of Algorithms /Shuai Cheng Li Page 11 What We Cover(continued): 3. Introduction to computational complexity NP-complete problems 4. Approximation algorithms Vertex cover Steiner trees Traveling sales man problem