Max-Cut with multiple cardinality constraints
From MaRDI portal
Cites work
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel
- A .699-approximation algorithm for Max-Bisection.
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A note on approximating Max-Bisection on regular graphs
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Approximating CSPs with global cardinality constraints using SDP hierarchies
- Approximation algorithms for maximization problems arising in graph partitioning
- Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Optimal pricing in networks with externalities
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Rounding Semidefinite Programming Hierarchies via Global Correlation
- Semialgebraic Proofs and Efficient Algorithm Design
- Submodular maximization with cardinality constraints
- The RPR2 rounding technique for semidefinite programs
This page was built for publication: Max-Cut with multiple cardinality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346841)
