|CSE 552: Randomized and Approximation Algorithms
|Class Meeting Time:||
CSE 450, 550, or equivalent.
|Special Needs:||If you are entitled to extra accommodation for any reason (such as a disability), we make every reasonable attempt to accommodate you. However, it is your responsibility to discuss this with the instructor at the beginning of the course.|
|Academic Honesty:||Work in this course, unless explicitly stated in writing to the contrary, is to be an effort by the individual student. It is not acceptable to use work other than your own without full attribution and acknowledgment. While -- unless explicitly stated to the contrary -- you are welcome to discuss problems with others, it is not acceptable to discuss solutions with them. If in doubt about anything related to academic integrity, see the instructor.|
|Texts:|| R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press.
V. Vazirani, Approximation Algorithms, Springer