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 of
2021/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
列 I can't find an efficient algorithm, I guess I 'm just too dumb 2021/26 CS4335 Design and Analysis of
2021/1/26 CS4335 Design and Analysis of Algorithms /Shuai Cheng Li Page 12
列 I can't find an efficient algorithm, because no such algorithm is possible! 2021/26 CS4335 Design and Analysis of
2021/1/26 CS4335 Design and Analysis of Algorithms /Shuai Cheng Li Page 13
I can't find an efficient algorithm, but neither can all these famous people 2021/26 CS4335 Design and Analysis of
2021/1/26 CS4335 Design and Analysis of Algorithms /Shuai Cheng Li Page 14
Why You have to take this course You can apply learned techniques to solve various problems Have a sense of complexities of various problems in different domains College graduates vs. University graduates Supervisor v.s. low level working force 2021/26 CS4335 Design and Analysis of
2021/1/26 CS4335 Design and Analysis of Algorithms /Shuai Cheng Li Page 15 Why You have to take this course You can apply learned techniques to solve various problems Have a sense of complexities of various problems in different domains College graduates vs. University graduates Supervisor v.s. low level working force