scientific article; zbMATH DE number 1303558
From MaRDI portal
Publication:4250183
zbMath0930.68142MaRDI QIDQ4250183
Publication date: 9 February 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Improved approximations for max set splitting and max NAE SAT ⋮ Inapproximability results for equations over finite groups ⋮ Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming ⋮ From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs ⋮ Supermodular functions and the complexity of MAX CSP ⋮ Reoptimization of constraint satisfaction problems with approximation resistant predicates ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ Building a small and informative phylogenetic supertree ⋮ A toolbox for barriers on interactive oracle proofs ⋮ On the hardness of efficiently approximating maximal non-\(L\) submatrices. ⋮ Pseudo-Boolean optimization ⋮ Inapproximability results for equations over infinite groups ⋮ Linear-consistency testing. ⋮ An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance ⋮ Unnamed Item ⋮ Semidefinite Programming and Constraint Programming ⋮ Improved parameterized set splitting algorithms: A Probabilistic approach ⋮ Unnamed Item ⋮ An Improved Dictatorship Test with Perfect Completeness ⋮ On bounded occurrence constraint satisfaction ⋮ Differential approximation for optimal satisfiability and related problems
