scientific article; zbMATH DE number 6381632
From MaRDI portal
Publication:2934583
Recommendations
- Near-optimal algorithms for maximum constraint satisfaction problems
- scientific article; zbMATH DE number 1002206
- Approximation algorithms for the maximum satisfiability problem
- Automata, Languages and Programming
- On the efficient approximability of constraint satisfaction problems
- scientific article; zbMATH DE number 1552232
- scientific article; zbMATH DE number 1258327
- The approximability of constraint satisfaction problems
- Algorithms for the maximum satisfiability problem
Cited in
(35)- An efficient algorithm for a class of constraint satisfaction problems
- Solving RCPSP/max by lazy clause generation
- Convex relaxations and integrality gaps
- Near-optimal algorithms for maximum constraint satisfaction problems
- Near-optimal algorithms for unique games
- Explicit optimal hardness via Gaussian stability results
- Exact and approximation algorithms for the maximum constraint satisfaction problem over the point algebra
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction
- Approximation algorithms for unique games
- Complexity of approximating CSP with balance/hard constraints
- Approximation algorithm for non-Boolean MAX k-CSP
- Simultaneous approximation of constraint satisfaction problems
- Maximum Constraint Satisfaction on Diamonds
- scientific article; zbMATH DE number 1303558 (Why is no real title available?)
- Randomized approximation of the constraint satisfaction problem
- Approximation of non-Boolean 2CSP
- Near-optimal UGC-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\)
- scientific article; zbMATH DE number 2119703 (Why is no real title available?)
- Re-optimization of constraint satisfaction problems with predicates of arity two
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\)
- A birthday repetition theorem and complexity of approximating dense CSPs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Beating the random assignment on constraint satisfaction problems of bounded degree
- Approximating dense MAX 2-CSPs
- Fast SDP algorithms for constraint satisfaction problems
- Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP
- On the efficient approximability of constraint satisfaction problems
- An LP-Designed Algorithm for Constraint Satisfaction
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Automata, Languages and Programming
- Approximation algorithm for non-Boolean \textsc{Max}-\(k\)-CSP
- Approximating CSPs with global cardinality constraints using SDP hierarchies
- The maximum feasible subset problem (maxFS) and applications
- Every 2-CSP allows nontrivial approximation
- A new approach for weighted constraint satisfaction
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 Q2934583)
