Reduce Clique to Set Cover Is it possible directly to reduce clique to set cover?
I know that there are some ways of direct reduction from Clique to Vertex Cover and from Vertex Cover to Set Cover, so I am very interested to know if the is a way to reduce clique to set cover directly without the use of the transitive rule.
Both problems are NP-complete and, by definition, there is a direct reduction between any pair of NP-complete problems.