Item

ITEM ACTIONS

This item is discarded!Release HistoryDetailsSummary

Discarded

Paper

Decomposition of Trees and Paths via Correlation

MPS-Authors

/persons/resource/persons201523

Lange, Jan-Hendrik
Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society;

/persons/resource/persons98382

Andres, Bjoern
Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

(No access)

Supplementary Material (public)

There is no public supplementary material available

Citation

Lange, J.-H., & Andres, B. (2017). Decomposition of Trees and Paths via Correlation. Retrieved from https://arxiv.org/abs/1706.06822v2.

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.