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

DOI10.1016/J.JCSS.2016.03.004zbMATH Open1342.68358OpenAlexW2327131051MaRDI QIDQ295639FDOQ295639

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

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

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)

Cites Work

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

Cited In (4)

• 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
• Approximation algorithm for sparsest \(k\)-partitioning

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)