Some polynomial special cases for the minimum gap graph partitioning problem

2018

16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018 - Proceedings of the Workshop

Some polynomial special cases for the minimum gap graph partitioning problem

04 Pubblicazione in atti di convegno

Bruglieri M., Cordone R., Lari I., Ricca F., Scozzari A.

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

Graph partitioning min-max gap optimization min-sum gap optimization