Question: Consider the following algorithm VCApprox2 for VERTEX-COVER, which looks strikingly similar to VCApprox (a) Compare the approximation ratios of Greedy-Balance and Sorted-Balance. (b) Compare the
Consider the following algorithm VCApprox2 for VERTEX-COVER, which looks strikingly similar to VCApprox

(a) Compare the approximation ratios of Greedy-Balance and Sorted-Balance. (b) Compare the time complexity of Greedy-Balance and Sorted-Balance. (c) Can you think of an instance where the solution produced by Sorted-Balance is exactly 1.5x the optimal solution? If not, why? (5) Reference material: Graham, Bounds On Multiprocessing Timing Anomalies, Siam J. Appl Math, Vol 17, No. 2, 1969
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
