IIIS, Tsinghua University

Algorithms 2025 Fall

Instructor: Jian Li ( lapordge@gmail.com ) 对照阅读

TA:

潘至璇 Zhixuan Pan panzx24@mails.tsinghua.edu.cn 对照阅读

周镇东 Zhendong Zhou zhouzd21@mails.tsinghua.edu.cn 继续了解

吕敬一 Jingyi Lv lv-jy22@mails.tsinghua.edu.cn

Time: Every Monday Morning (9:50-12:15)
Classroom: 建华/经管新楼LG1-16

Overview:

This is a first course in design and analysis of algorithms
for undergraduate students. The main focus is about
some fundamental algorithmic techniques, such as greedy,
divide and conquer, dynamic programming and so on,
some fundamental combinatorial objects, such as graphs,
network flows, strings and so on,
and various mathematical tools to analyze them.
In the later part of the course, I will touch some
more advanced topics such as approximation algorithms
for NP-hard problems, randomized algorithms and so on.
The course forms a foundation for all areas of computer science.
We will discuss algorithmic problems from a variety of areas
such as AI, computational biology, networking and so on.

I will teach basic algorithmic concepts and techniques
in class, followed by some simple applications.
More advanced applications will be delivered in the
homeworks which form an important part of the course
and contribute to 25% of the final grade.

There is a course project (a research survey) with 25% points. (the specification will be made clear in xuetang)

We will also have the final exam, contributing to
50% to the final grade, respectively.

Textbook：Algorithm Design, by Jon Kleinberg and Eva Tardos. (You should be able to find it in Taobao also.)

We will use some homework problems from this book.

-------------------

Homeworks will be uploaded to Xuetang each week (usually before Wed).

The deadline is Wed of the next week. (so you have 1 week).

We will deduct 20% for a late hw for each day after the deadline (e.g., if you are 2 days late, we will subtract 40%）

For bonus problems, you have two weeks.

For research problems, you have the whole semester.

-------------------

Grade:

Homework: 25 pts, Bonus problem (<=5 pts), Research problem (<=10 pts, or exam waived for high quality research)

Mid term. 25 pts (in class), Scope: week 1-8

Final exam: 50 pts (in the exam week). Scope: things covered during the entire semester

-------------------

Other Refs：

[1] Introduction to Algorithms, 3rd edition (CLRS)
By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

[2] Approximation Algorithms
By Vijay V. Vazirani

[3] Randomized Algorithms
Rajeev Motwani, Prabhakar Raghavan


　

Link:

Fall 2011 Algorithms

Fall 2012 Courses for Undergraduate Students

Fall 2015 Algorithms