NP-hard problems and Approximation algorithms12 2-approximation for VC Minimum Vertex Cover - NP-hard problem (maximum is trivially n) Algorithm: Init
{"Image DocumentName": "NP-hard problems and Approximation algorithms", "Image ImageDescription": "2-approximation for VC. Minimum Vertex Cover - NP-hard problem. (maximum is trivially n) Algorithm: Initialize set C to an empty set. While there are remaining edges: Choose an edge {v,w} with the largest degree, where degree of an edge is a sum of degrees of its ends v,w in a current graph G. Put v,w to C. Remove all the edges adjacent to nodes v,w from graph G. Output: witness set C and its size. NP-hard problems and Approximation algorithms.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}