Minimum nonuniform graph partitioning with unrelated weights

DOI10.1070/SM8903zbMath1390.05191arXiv1401.0699MaRDI QIDQ4610203

Konstantin Makarychev, Yury Makarychev

Publication date: 6 April 2018

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.0699

zbMATH Keywords

semidefinite programmingapproximation algorithmapproximation for treesminimum nonuniform graph partition problemminimum nonuniform graph partition problem with unrelated weights

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Non-Uniform Graph Partitioning
• Approximation Algorithm for Sparsest k-Partitioning
• Multiply Balanced k −Partitioning
• Min-Max Graph Partitioning and Small Set Expansion

This page was built for publication: Minimum nonuniform graph partitioning with unrelated weights