Pages that link to "Item:Q5918464"
From MaRDI portal
The following pages link to Approximation algorithms for maximally balanced connected graph partition (Q5918464):
Displaying 12 items.
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation algorithms for maximization problems arising in graph partitioning (Q2775885) (← links)
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges (Q4606320) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
