2 research outputs found
Some polynomial special cases for the Minimum Gap Graph Partitioning Problem
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirected graph into p connected subgraphs with minimum gap between the largest and the smallest vertex weight
Partitioning a graph into minimum gap components
We study the computational complexity and approximability for the problem of partitioning a vertex-weighted undirected graph into p connected subgraphs with minimum gap between the largest and the smallest vertex weights