The lecture introduces the notion of polynomial-time reduction of one problem to another via a polynomial number of standard computational steps and a polynomial time number of calls to a black box solver to solve a problem. Given a graph, the independent set problem asks for a set of vertices for which there exists no edge between any pair of vertices in the set. The vertex cover problem asks for the set of vertices that for any edge at least one endpoint is contained in that set. The solution of the independent set problem is polynomial-time equivalent to the solution of the set cover problem. The set cover problem generalizes the vertex cover problem and the independent set problem generalizes to the set packing problem.
- Күн бұрын
polynomial-time reductions of independent set and vertex cover, generalizations to set cover
- Рет қаралды 42
Пікірлер