<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-12-12 06:04:13NP-complete problems Combinatorial optimization Graph coloring Probabilistic complexity theory Algorithms Semidefinite programming Randomized algorithm Approximation algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics |
Add to Reading List |
Approximation Algorithms (ADM III) | Advanced Approximation Algorithms (CMU 18-854B, SpringLecture 2: LP Relaxations, Randomized Rounding Jan 17, 2008DocID: 1tp7O - View Document |
| Iterative Randomized Rounding Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011 Joint work with Jaroslaw Byrka,DocID: 1skvJ - View Document |
| arXiv:1110.4319v2 [cs.DS] 20 Oct 2011DocID: 1r9bi - View Document |
| The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011DocID: 1r2GX - View Document |
| Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees Stephen H. Bach University of MarylandDocID: 1r1cx - View Document |