Improved approximation algorithms for balanced partitioning problems

DOI10.4230/LIPICS.STACS.2016.58MaRDI QIDQ4601910zbMATH OpenFDO

Authors Harald Räcke, Richard Stotz

Publication date 24 January 2018

zbMATH Keywords

dynamic programminggraph partitioningscheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Balanced graph partitioning
• Partitioning graphs into balanced components
• Fast Approximate Graph Partitioning Algorithms
• Balanced partitions of trees and applications
• Balanced partitions of trees and applications

Cited in

(11)

• Balanced graph partitioning
• Balanced Judicious Bipartition is Fixed-Parameter Tractable
• Improved Approximation Algorithms for Budgeted Allocations
• An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment
• Multiply balanced k-partitioning
• Algorithms for the Balanced Edge Partitioning Problem
• Approximation algorithm for the balanced 2-connected k-partition problem
• Partitioning graphs into balanced components
• Approximation and parameterized algorithms for balanced connected partition problems
• Fast balanced partitioning is hard even on grids and trees
• Fast balanced partitioning is hard even on grids and trees

This page was built for publication: Improved approximation algorithms for balanced partitioning problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601910)