Can I read MAX SNP-Hardness of H-Matching on EtoBox?
MAX SNP-Hardness of H-Matching by Steven Miltenburg is a document available to read on EtoBox.
What is MAX SNP-Hardness of H-Matching about?
The document establishes that the problem of maximum H-matching is MAX SNP-hard for any graph H with three or more nodes in a connected component. It provides a proof through reductions from the maximum bounded 3-satisfiability problem, demonstrating that the problem is also MAX SNP-complete when H is connected with bounded node degrees. The study contributes to the understanding of the approximability of NP-hard optimization problems within the MAX SNP complexity class.
- Author
- Steven Miltenburg
- Language
- EN