In this seminar, we cover topics in the area of Randomized and Approximation Algorithms. Many optimization problems arising in theory and practice have been proved that optimal solutions cannot be computed efficiently unless P=NP. One approach to handle these problems is to design approximation algorithms, i.e., efficiently find a near-optimal solution. Randomized algorithms are another widely used approach to deal with problems for which efficient deterministic algorithms are not known.
The first meeting takes place on October 19 (Wednesday). In this meeting the topics will be assigned.
If you are interested in participating in the seminar, please send an e-mail to Kelin Luo and come to the first meeting.
If you would like to participate in the seminar but cannot attend the first meeting, please send us an email.