scientific article; zbMATH DE number 5764850

MaRDI QIDQ3579443zbMATH OpenFDO

Authors Claire Mathieu, Warren Schudy

Publication date 6 August 2010

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cited in

(9)

• Approximation schemes for the betweenness problem in tournaments and related ranking problems
• Sublinear algorithms for MAXCUT and correlation clustering
• Sublinear-time quadratic minimization via spectral decomposition of matrices
• Amplification and Derandomization without Slowdown
• Solving MaxCut with quantum imaginary time evolution
• Exploiting dense structures in parameterized complexity
• Min-CSPs on complete instances. II: Polylogarithmic approximation for Min-NAE-3-SAT
• Approximating maximum cut on interval graphs and split graphs beyond Goemans-Williamson
• Triangles improve 0.878 approximation for Maxcut

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579443)