An improved SDP rounding approximation algorithm for the max hypergraph bisection
From MaRDI portal
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 polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- 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
- Approximability of maximum splitting of k-sets and some other Apx-complete problems
- Approximating CSPs with global cardinality constraints using SDP hierarchies
- Approximation algorithms for maximization problems arising in graph partitioning
- 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}}
- Bisections of graphs
- Bounding probability of small deviation: a fourth moment approach
- Bounds on maximum weight directed cut
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Constructing worst case instances for semidefinite programming based approximation algorithms
- scientific article; zbMATH DE number 1670644 (Why is no real title available?)
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- scientific article; zbMATH DE number 1303558 (Why is no real title available?)
- scientific article; zbMATH DE number 1342117 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- scientific article; zbMATH DE number 2119703 (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
- Inapproximability results for set splitting and satisfiability problems with no mixed clauses
- Lower Bounds for Maximum Weighted Cut
- Moments tensors, Hilbert's identity, and \(k\)-wise uncorrelated random variables
- Non-oblivious local search for graph and hypergraph coloring problems
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability
- Some optimal inapproximability results
- Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
- The hardness of approximation: Gap location
- The RPR2 rounding technique for semidefinite programs
This page was built for publication: An improved SDP rounding approximation algorithm for the max hypergraph bisection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349158)
