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.
Partitioning a graph into minimum gap components / M. Bruglieri, R. Cordone. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - 55:(2016 Nov), pp. 33-36. [10.1016/j.endm.2016.10.009]
Partitioning a graph into minimum gap components
R. CordoneSecondo
2016
Abstract
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
ElectronicNotesDiscreteMathematic_Partitioning_2016.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
176.52 kB
Formato
Adobe PDF
|
176.52 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
