Separate different tags with a comma. In order to set up a list of libraries that you have access to, you must first login or sign up. Open to the public ; Mos Goemans and David P. Open Preview See a Problem?
|Genre:||Health and Food|
|Published (Last):||26 August 2013|
|PDF File Size:||2.72 Mb|
|ePub File Size:||15.18 Mb|
|Price:||Free* [*Free Regsitration Required]|
This will be the regular slot from now on. The first tutorial will be April, 25th in the regular lecture slot, i. The lecture starts in the second week of the semester, i. If you missed the first lecture, you can still join! If you have any question, simply write a mail to Dominik Krupke.
We are happy about every interested student. Since a large percentage of the students has problems with the slots for exercises and small tutorials, these will be moved to a more convenient slot. You will soon receive an e-mail regarding this matter.
General Information We do only use this website and the below mentioned mailinglist to distribute informations. No studip etc. If there are any questions, do not hesitate to write a mail to Dominik Krupke. Homework Sets There will be biweekly mandatory homework. Please check the material area. Literature: The first part of the lecture will be on basic results for which the following books can be useful Vazirani, Vijay V. Hochbaum, more info. Williamson and David B. Shmoys, published by Cambridge University Press.
Mailing List There will be a mailing list. We will distribute the homework sets and other announcements via this list, so, please subscribe!
You may also want to check out the alg-studs mailing list which is similiar to cs-studs but for algorithmic students.
Approximation Algorithms for NP-Hard Problems
Approximation algorithms for NP-hard problems
APPROXIMATION ALGORITHMS FOR NP HARD PROBLEMS DORIT HOCHBAUM PDF