Optimal Partition of a Tree with Social Distance

Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono

We study the problem to find a partition of \textcolor{black}{a} graph $G$ with maximum social welfare based on social distance between vertices in $G$, called MaxSWP. This problem…