Publication:3549613
From MaRDI portal
zbMath1232.68060MaRDI QIDQ3549613
Publication date: 5 January 2009
90C35: Programming involving graphs or networks
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder, Biased random k‐SAT, Mathematics of computation through the lens of linear equations and lattices, Noise stability of functions with low influences: invariance and optimality, Maximally stable Gaussian partitions with discrete applications, On regularity of Max-CSPs and Min-CSPs, Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix