The following pages link to Better Balance by Being Biased (Q4962636):
Displaying 6 items.
- Bisections of graphs without \(K_{2, l}\) (Q1735680) (← links)
- Private non-monotone submodular maximization (Q2091093) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)
