Approximating CSPs Using LP Relaxation (Q3448840): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_67 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2405977959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation resistance from pairwise independent subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal algorithms for unique games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Characterization of Constant-Factor Approximable Min CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of the random hyperplane rounding technique for MAX CUT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating CSPs Using LP Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of non-boolean 2CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming, width-1 CSPs, and robust satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5497122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian bounds for noise correlation of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise stability of functions with low influences: invariance and optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel approximation algorithms by positive linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191593 / rank
 
Normal rank

Latest revision as of 23:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Approximating CSPs Using LP Relaxation
scientific article

    Statements

    Approximating CSPs Using LP Relaxation (English)
    0 references
    0 references
    0 references
    27 October 2015
    0 references
    0 references
    0 references