Fast Balanced Partitioning Is Hard Even on Grids and Trees

DOI10.1007/978-3-642-32589-2_34zbMath1365.68266OpenAlexW1607118338MaRDI QIDQ2912736

Andreas Emil Feldmann

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_34

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Fast balanced partitioning is hard even on grids and trees ⋮ Balanced tree partition problems with virtual nodes ⋮ Multi-level spectral graph partitioning method ⋮ Balanced partitions of trees and applications

Uses Software

• PT-Scotch

This page was built for publication: Fast Balanced Partitioning Is Hard Even on Grids and Trees