An Introduction to Randomized algorithms - School of Technology ...
An Introduction to Randomized algorithms - School of Technology ...
An Introduction to Randomized algorithms - School of Technology ...
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Randomized</strong> RoundingV = {x 1 , . . . x n } boolean variables.F = C 1 ∧ . . . ∧ C m ; each C j is a disjunction <strong>of</strong> literals.Eg : C j = x 1 v x c 4 v x 5.MaxSat(F , V ) : Given F over V , find an assignmentsatisfying the maximum number <strong>of</strong> clauses.This is a NP-hard problem.A simple deterministic alg satisfies at least m/2 clauses.Can we do better ?
Change language