scientific article; zbMATH DE number 7051264
From MaRDI portal
Publication:4633907
zbMath1411.68085MaRDI QIDQ4633907
Joseph (Seffi) Naor, Robert Krauthgamer, Roy Schwartz
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496872
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Balanced connected graph partition ⋮ Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems ⋮ An exact algorithm for min-max hyperstructure equipartition with a connected constraint ⋮ Metaheuristics for the minimum gap graph partitioning problem ⋮ Fast balanced partitioning is hard even on grids and trees ⋮ Balanced tree partition problems with virtual nodes ⋮ Minimum nonuniform graph partitioning with unrelated weights ⋮ Dynamic Balanced Graph Partitioning ⋮ Approximation Algorithms for CSPs ⋮ Partitioning a graph into small pieces with applications to path transversal ⋮ Balanced partitions of trees and applications
