Approximating Maximum Cut with Limited Unbalance
From MaRDI portal
Recommendations
- Approximation algorithms for maximum cut with limited unbalance
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for MAX k-CUT and MAX BISECTION
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
Cited in
(13)- A randomized approximation scheme for metric MAX-CUT
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix
- Approximation algorithms for maximum cut with limited unbalance
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Unbalanced graph cuts with minimum capacity
- scientific article; zbMATH DE number 1670644 (Why is no real title available?)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
- Approximating minimum cut with bounded size
- Constant factor approximation for balanced cut in the PIE model
- Graph-Theoretic Concepts in Computer Science
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints
This page was built for publication: Approximating Maximum Cut with Limited Unbalance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443520)
