Pages that link to "Item:Q4601910"
From MaRDI portal
The following pages link to Improved approximation algorithms for balanced partitioning problems (Q4601910):
Displaying 8 items.
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Balanced graph partitioning (Q863200) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment (Q1631652) (← links)
- Improved Approximation Algorithms for Budgeted Allocations (Q3521918) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- The complexity of tree partitioning (Q5918926) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)