Back to Results
First PageMeta Content
Operations research / NP-complete problems / Linear programming / Real algebraic geometry / Semidefinite programming / 2-satisfiability / Mathematical optimization / Constraint satisfaction problem / Constraint satisfaction / Theoretical computer science / Applied mathematics / Computational complexity theory


Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems Moses Charikar∗ Konstantin Makarychev∗†
Add to Reading List

Document Date: 2014-06-08 22:16:07

Open Document

File Size: 187,72 KB

Share Result on Facebook

Company

CNF / /

IndustryTerm

vector solution / approximation algorithm / 2SAT algorithm / trivial algorithm / polynomial time algorithm / approximation algorithms / /

Organization

Princeton University / National Science Foundation / /

Person

MAX DICUT / Yury Makarychev / Konstantin Makarychev∗† Yury / Williamson / /

Technology

0.758 approximation algorithm / MAX CUT algorithm / approximation algorithms / Analysis The approximation algorithm / 2.2 Algorithm / second algorithm / polynomial time algorithm / approximation algorithm / 3 3.1 Approximation Algorithm / 0.796 approximation algorithm / trivial algorithm / MAX 2SAT algorithm / 2 Approximation Algorithm / /

URL

http /

SocialTag