Efficient Recruiting and Algorithm Design: Set Cover, Hamiltonian Path, and Longest Increasing Subsequence
Classified in Computers
Written on in English with a size of 3.2 KB
Set Cover to Efficient Recruiting
Input: Set U of elements, collection S1, ..., Sm of subsets of U, integer k ≥ 0
Construct an instance of the Efficient Recruitment Problem:
- Sports are represented by U.
- Applicants are represented by {1, ..., m}.
- For every s ∈ U and 1 ≤ i ≤ m, M[s, i] = 'qualified' if s ∈ Si and 'not qualified' otherwise.
Steps:
- Call the oracle for Efficient Recruiting with input M and k.
- Return the result (yes or no) of the previous call.
Vertex Cover and Hitting Set
Graph: G = (V, E)
- U = V(G)
- Si = {u, v}, where (u, v) is an edge of G.
Vertex Cover ⇒ Hitting Set:
If C is a vertex cover for G of size k, then by definition, for every edge (u, v) in G, either u ∈ C or v ∈ C. Therefore, C is a solution for Hitting Set because... Continue reading "Efficient Recruiting and Algorithm Design: Set Cover, Hamiltonian Path, and Longest Increasing Subsequence" »