@online{DBLP:journals/corr/LangeA17,
TITLE = {Decomposition of Trees and Paths via Correlation},
AUTHOR = {Lange, Jan-Hendrik and Andres, Bjoern},
LANGUAGE = {eng},
URL = {https://arxiv.org/abs/1706.06822v2},
EPRINT = {1706.06822v2},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for the special case of the tree being a star, we show that the problem is NP-hard. For the special case of the tree being a path, this problem is known to be polynomial time solvable. We characterize several classes of facets of the combinatorial polytope associated with a formulation of this clustering problem in terms of lifted multicuts. In particular, our results yield a complete totally dual integral (TDI) description of the lifted multicut polytope for paths, which establishes a connection to the combinatorial properties of alternative formulations such as set partitioning.},
}