Course: Design Methodologies for Computer Algorithms a.k.a. Approximation Algorithms
- Department of Computer Science and Information Engineering, National Taiwan University, Spring, 2002
- Lecturer: Prof. Hsueh-I Lu
- Time: 2PM-5PM, Tuesday. Classroom: Room 105, Department building of CSIE
- Prerequisites: (a) Data Structures, (b) Algorithms.
- We will study approximation algorithms this semester. Click here for the synopsis of this course in Chinese. The textbook and reference books are as follows.
- TEXTBOOK: "Approximation Algorithms", by V. Vazirani, 2001.
- REFERENCE 1: "Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties", by G. Ausiello, P. Crescenzi, V. Kann, Marchetti-sp, Giorgio Gambosi, Alberto M. Spaccamela, 2000
- REFERENCE 2: "Approximation Algorithms for NP-hard problems", by D. Hochbaum, 1996.
- Join the mailing list called
'approx@coollist.com' by filling out this form,
and you will receive the broadcasting messages of this course.
- There is a BBS board "ApproxAlgo" at jupiter.csie.ntu.edu.tw.
Discussion about this course can be found there.
- Homework 1.
- Final presentation.
- Midterm exam: problem set and grades.
- Final grades.
Interesting URLs:
This set of webpages is maintained by Hsueh-I Lu
Number of accesses since December 24, 2001.
FastCounter by bCentral