Publication:3579443
From MaRDI portal
zbMath1192.90235MaRDI QIDQ3579443
Publication date: 6 August 2010
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Amplification and Derandomization without Slowdown, Sublinear Algorithms for MAXCUT and Correlation Clustering, Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices, Solving MaxCut with quantum imaginary time evolution, Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems