Pages that link to "Item:Q896161"
From MaRDI portal
The following pages link to Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161):
Displaying 8 items.
- Max-min weight balanced connected partition (Q386475) (← links)
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment (Q1631652) (← links)
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs (Q2905305) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925556) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925672) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)