Maximum Bounded H-Matching is MAX SNP-Complete

  title={Maximum Bounded H-Matching is MAX SNP-Complete},
  author={Viggo Kann},
  journal={Inf. Process. Lett.},
We prove that maximum H-matching (the problem of determining the maximum number of node-disjoint copies of the fixed graph H contained in a variable graph) is a MAX SNP-hard problem for any graph H that has three or more nodes in some connected component. If H is connected and the degrees of the nodes in H are bounded by a constant the problem is MAX SNP-complete. 
Highly Cited
This paper has 42 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-6 of 6 references

On the approximability of NP-complete optimization problems, Ph.D

  • V. Kann
  • Thesis, Dept. of Numerical Analysis and Computing…
  • 1992

Approximation algorithms for NP-complete problems on planar graphs

  • B. S. Baker
  • in: Proc. 24th Ann. IEEE Symp. on Foundations of…
  • 1983

Similar Papers

Loading similar papers…