scientific article; zbMATH DE number 6395195

DOI10.4086/toc.2014.v010a013zbMath1319.68254arXiv1206.3603OpenAlexW2097098285MaRDI QIDQ5497122

Yury Makarychev, Konstantin Makarychev

Publication date: 3 February 2015

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.3603

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

semidefinite programmingapproximation algorithmsconstraint satisfaction

Mathematics Subject Classification ID

Semidefinite programming (90C22) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (4)

Approximating CSPs Using LP Relaxation ⋮ Approximation Algorithms for CSPs ⋮ Unnamed Item ⋮ The Quest for Strong Inapproximability Results with Perfect Completeness

Cites Work

• Parallel approximation algorithms by positive linear programming
• On the power of unique 2-prover 1-round games
• Rectangular Confidence Regions for the Means of Multivariate Normal Distributions

This page was built for publication: