scientific article
From MaRDI portal
Publication:2904753
DOI10.4230/LIPIcs.STACS.2012.100zbMath1245.68248MaRDI QIDQ2904753
Andreas Emil Feldmann, Luca Foschini
Publication date: 23 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (6)
Fast balanced partitioning is hard even on grids and trees ⋮ Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence ⋮ Beyond good partition shapes: an analysis of diffusive graph partitioning ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ Optimized quantum circuit partitioning ⋮ Balanced partitions of trees and applications
This page was built for publication:
