An improved approximation algorithm for hypergraph max p-section
From MaRDI portal
An improved approximation algorithm for hypergraph max \(p\)-section
Cites work
- A .699-approximation algorithm for Max-Bisection.
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
- A note on approximating Max-Bisection on regular graphs
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- An improved approximation algorithm for the Max-3-Section problem
- An improved rounding method and semidefinite programming relaxation for graph partition
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Approximating CSPs with global cardinality constraints using SDP hierarchies
- Approximation algorithms for maximum cut with limited unbalance
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat}
- Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
- scientific article; zbMATH DE number 1304324 (Why is no real title available?)
- scientific article; zbMATH DE number 1342117 (Why is no real title available?)
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved approximation of Max-Cut on graphs of bounded degree
- Improved approximations for max set splitting and max NAE SAT
- Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
- The RPR2 rounding technique for semidefinite programs
This page was built for publication: An improved approximation algorithm for hypergraph max \(p\)-section
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6928014)
