DOIAbstract
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
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
Graph partitioning is a widely studied problem in the literature with several applications in real l...
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are g...
\u3cp\u3eGiven an undirected and connected graph G = (V, E) and two vertices s, t ∈ V, a vertex subs...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
We study the computational complexity and approximability for the problem of partitioning a vertex-w...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
The Minimum Gap Graph Partitioning Problem (MGGPP) consists in partitioning a vertex-weighted undire...
AbstractAssume that each vertex of a graph G is assigned a nonnegative integer weight and that l and...
We address the min-sum version of the Minimum Gap Graph Partitioning Problem through a Tabu Search m...
Let G = (N; E) be an edge-weighted undirected graph. The graph partitioning problem is the problem o...
Graph partitioning is a widely studied problem in the literature with several applications in real l...
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are g...
\u3cp\u3eGiven an undirected and connected graph G = (V, E) and two vertices s, t ∈ V, a vertex subs...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
We study the computational complexity and approximability for the problem of partitioning a vertex-w...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
The Minimum Gap Graph Partitioning Problem (MGGPP) consists in partitioning a vertex-weighted undire...
AbstractAssume that each vertex of a graph G is assigned a nonnegative integer weight and that l and...
We address the min-sum version of the Minimum Gap Graph Partitioning Problem through a Tabu Search m...
Let G = (N; E) be an edge-weighted undirected graph. The graph partitioning problem is the problem o...
Graph partitioning is a widely studied problem in the literature with several applications in real l...
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are g...
\u3cp\u3eGiven an undirected and connected graph G = (V, E) and two vertices s, t ∈ V, a vertex subs...
Add to ORKG