Pages that link to "Item:Q2030323"
From MaRDI portal
The following pages link to Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323):
Displaying 9 items.
- Political districting to minimize cut edges (Q2099493) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- Mathematical political districting taking care of minority groups (Q2241590) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
