Artículo de revista
Clique partitioning with value-monotone submodular cost
Fecha
2015Registro en:
Discrete Optimization 15 (2015) 26–36
DOI: 10.1016/j.disopt.2014.11.001
Autor
Correa Haeussler, José
Megow, Nicole
Institución
Resumen
We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. We present a general algorithmic solution based on solving the problem variant without the cardinality constraint. We obtain constant factor approximations depending on the solvability of this relaxation for a large class of submodular cost functions which we call value-monotone submodular functions. For special graph classes we give optimal algorithms.