@article{CorreaM2015,
TITLE = {Clique Partitioning with Value-monotone Submodular Cost},
AUTHOR = {Correa, Jos{\'e} R. and Megow, Nicole},
LANGUAGE = {eng},
ISSN = {1572-5286},
DOI = {10.1016/j.disopt.2014.11.001},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2015},
DATE = {2015},
ABSTRACT = {Abstract 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.},
JOURNAL = {Discrete Optimization},
VOLUME = {15},
PAGES = {26--36},
}