... 14Ratio bound of Greedy-set-coverLet denote the dth harmonic number d hd = Σi-11/iTheorem: Greedy-set-cover has a ratio bound H(max{|S|: S ∈F})Corollary: Greedy-set-cover has a ratio ... searchDecrease-and-conquer Insertion sort, DFS, BFSTransform-and-conquer heapsort, Gauss eliminationGreedy Prim’s, Dijkstra’sDynamic Programming Floyd’sBacktrackingBranch-and-BoundApproximate algorithms Heuristics ... it.Vertex-cover problem: find a vertex-cover of minimal size.This problem is NP-hard, since the related decision problem is NP-complete 16APPROX-TSP-TOURThe algorithm computes a near-optimal...