... 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 ... Bruce-force Sequential search, selection sortDivide-and-conquer Quicksort, mergesort, binary searchDecrease-and-conquer Insertion sort, DFS, BFSTransform-and-conquer heapsort, Gauss eliminationGreedy ... cover problemThe set cover problemTSP 20Ratio bound of APPROX-TSP-TOURTheorem: APPROX-TSP-TOUR is an approxima-tion algorithm with a ratio bound of 2 for the TSP with triangle inequality.Proof:...