For Max-Cut with multiple cardinality constraints, an (0.858 - ε)-approximation algorithm is given, improving the previous (0.5 + ε0) guarantee for sparse single-constraint instances.
Maximizing a monotone submodular function subject to a matroid constraint
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Max-Cut with Multiple Cardinality Constraints
For Max-Cut with multiple cardinality constraints, an (0.858 - ε)-approximation algorithm is given, improving the previous (0.5 + ε0) guarantee for sparse single-constraint instances.