Technical Terms NP-hard: A class of problems for which no polynomial-time solution algorithm is known and to which any problem in NP can be reduced. Vertex Cover: A subset of vertices such that ...

View on Coursera Course Description This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving ...