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
BRUGLIERI, MAURIZIO;
2016-01-01
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 | |
---|---|---|---|
PaperPreprint.pdf
Open Access dal 22/11/2017
Descrizione: Articolo_principale
:
Pre-Print (o Pre-Refereeing)
Dimensione
75.25 kB
Formato
Adobe PDF
|
75.25 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.