Approximation algorithms and hardness results for the clique packing problem Original Research Article

For a fixed family image of graphs, an image-packing in a graph image is a set of pairwise vertex-disjoint subgraphs of image, each isomorphic to an element of image. Finding an image-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just image. In this paper we provide new approximation algorithms and hardness results for the image-packing problem where image.