CIT 5960 Spring 2023 Final Exam
CIT 5960 – Spring 2023 Final Exam Practice Problems Solutions 1. You are given an undirected graph G(V,E) in adjacency-list representation such that every vertex in G has degree at most k. Design a polynomial-time (k + 1)-approximation algorithm for the maximum independent set problem on such graphs. Prove that your algorithm achieves the stated …