Approximation Algorithms for the k-Clique Covering Problem

Approximation Algorithms for the k-Clique Covering Problem

The problem of covering edges and vertices in a graph or in a hypergraph was motivated by a problem arising in the context of component assembly problem The problem is given a graph and a clique size k nd the minimum number of k cliques such that all edges and vertices of the graph are covered by included in the cliques This paper provides a collection of approximation algorithms for various cl...

Approximation algorithms for the k-clique covering problems

The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a problem arising in the context of the component assembly problem. The problem is as follows: given a graph and a clique size k, find the minimum number of k-cliques such that all edges and vertices of the graph are covered by (included in) the cliques. This paper provides a collection of approximation ...

Approximation algorithms for the covering Steiner problem

Approximation algorithms and hardness results for the clique packing problem

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

Two new heuristic algorithms for Covering Tour Problem

Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...