A .699-approximation algorithm for Max-Bisection.
From MaRDI portal
Recommendations
- 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
- scientific article; zbMATH DE number 1762086
- Approximation algorithms for max cut and max bisection problems using semidefinite programming relaxations
Cited in
(41)- An approximation algorithm for scheduling two parallel machines with capacity constraints.
- On approximation of max-vertex-cover
- Improved approximations for max set splitting and max NAE SAT
- Approximation algorithm for MAX DICUT with given sizes of parts
- On semidefinite programming relaxations of maximum \(k\)-section
- An improved kernel for max-bisection above tight lower bound
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- A proximal augmented method for semidefinite programming problems
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- Speeding up a memetic algorithm for the max-bisection problem
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix
- An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation
- Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
- Approximation algorithms for maximum cut with limited unbalance
- A multiple penalty function method for solving max-bisection problems
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- Relaxations of combinatorial problems via association schemes
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
- Complexity of approximating CSP with balance/hard constraints
- Memetic search for the max-bisection problem
- Approximating Max Cut with Limited Unbalance
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
- Improved approximation algorithms for MAX k-CUT and MAX BISECTION
- A feasible direction algorithm for max bisection via low-rank factorization
- scientific article; zbMATH DE number 2063458 (Why is no real title available?)
- scientific article; zbMATH DE number 2140434 (Why is no real title available?)
- Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
- A new Lagrangian net algorithm for solving max-bisection problems
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- An improved approximation algorithm for hypergraph max p-section
- A MILP model for the connected multidimensional maximum bisection problem
- Max-Cut with multiple cardinality constraints
- Improved approximation algorithms for maximum graph partitioning problems
- The capacitated max \(k\)-cut problem
- A successive quadratic programming algorithm for SDP relaxation of Max-Bisection
- A modified VNS metaheuristic for max-bisection problems
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints
This page was built for publication: A .699-approximation algorithm for Max-Bisection.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5930726)
