The following pages link to (Q2934583):
Displaying 18 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- A new approach for weighted constraint satisfaction (Q698082) (← links)
- An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
- Solving RCPSP/max by lazy clause generation (Q2434317) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Near-optimal algorithms for maximum constraint satisfaction problems (Q2930257) (← links)
- Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra (Q2957877) (← links)
- Approximation algorithms for unique games (Q3002794) (← links)
- Maximum Constraint Satisfaction on Diamonds (Q3524191) (← links)
- (Q4250183) (← links)
- Near-Optimal UGC-hardness of Approximating Max k-CSP_R (Q4636446) (← links)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313018) (← links)
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? (Q5454254) (← links)
- Automata, Languages and Programming (Q5466451) (← links)
- (Q5743406) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
- Every 2-CSP allows nontrivial approximation (Q5919233) (← links)
