The Complexity of Tree Partitioning

ALGORITHMICA, pp. 2606.0-2643.0, 2020.

Cited by: 0|Views8
EI

Abstract:

Given a tree T on n vertices, and k, b, s 1,., s b. N, the Tree Partitioning problem asks if at most k edges can be removed from T so that the resulting components can be grouped into b groups such that the number of vertices in group i is s i, for i = 1,., b. The case where s 1 =. = s b = n/b, referred to as the Balanced Tree Partitionin...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments