A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
From MaRDI portal
Publication:6064054
DOI10.1007/s10898-022-01183-7zbMath1528.90229OpenAlexW4282936435MaRDI QIDQ6064054
No author found.
Publication date: 8 November 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01183-7
Semidefinite programming (90C22) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat}
- New semidefinite programming relaxations for box constrained quadratic program
- Approximation algorithms for indefinite complex quadratic maximization problems
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Improved approximations for max set splitting and max NAE SAT
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Approximation algorithms for maximum cut with limited unbalance
- Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- P-Complete Approximation Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Better Balance by Being Biased
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Algorithms – ESA 2005
- The RPR2 rounding technique for semidefinite programs
- A .699-approximation algorithm for Max-Bisection.
This page was built for publication: A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
