Better Balance by Being Biased

DOI10.1145/2907052zbMath1422.68283OpenAlexW2127816126MaRDI QIDQ4962636

Konstantinos Georgiou, Siavosh Benabbas, Per Austrin

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2907052

zbMATH Keywords

semidefinite programmingapproximation algorithmsmax bisection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (6)

A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis ⋮ Constrained Submodular Maximization via a Nonsymmetric Technique ⋮ Bisections of graphs without \(K_{2, l}\) ⋮ A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints ⋮ Simultaneous max-cut is harder to approximate than max-cut ⋮ Private non-monotone submodular maximization

This page was built for publication: Better Balance by Being Biased