Approximation algorithms for the weighted t-uniform sparsest cut and some other graph partitioning problems

DOI10.1016/J.JCSS.2016.03.004MaRDI QIDQ295639zbMATH OpenOpenAlexFDO

Authors Mohammad Khairul Hasan, Kyung-Yong Chwa

Publication date 13 June 2016

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2016.03.004

zbMATH Keywords

clusteringlinear programmingapproximation algorithmgraph partitioningsparsest cut

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Approximation algorithm for sparsest \(k\)-partitioning
• Nonuniform graph partitioning with unrelated weights
• Unbalanced graph partitioning
• Unbalanced graph partitioning
• Fixed parameter approximation scheme for min-max \(k\)-cut

Cites work

• scientific article; zbMATH DE number 5485537 (Why is no real title available?)
• A tight bound on approximating arbitrary metrics by tree metrics
• An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
• Approximate max-flow min-(multi)cut theorems and their applications
• Approximations for the isoperimetric and spectral profile of graphs and related parameters
• Cut problems in graphs with a budget constraint
• Euclidean distortion and the sparsest cut (extended abstract)
• Expander flows, geometric embeddings and graph partitioning
• Min-max Graph Partitioning and Small Set Expansion
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• On cutting a few vertices from a graph
• Partitioning graphs into balanced components
• Unbalanced graph partitioning

Cited in

(4)

• Approximation algorithm for sparsest \(k\)-partitioning
• Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
• Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
• Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem

This page was built for publication: Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems

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