In question 2, there has been a mistake in the phrasing of the question. In each part, you should find an infinite non-trivial family of graphs Gn that apply the inequality as equality. I.e. For each n, Gn has Omega(n) vertices and Omega(n) edges.
Lecture instead of tutorial (again)
Tomorrow (20/4), there will be a lecture instead of the tutorial (13:30-14:30) in addition to the morning lecture.
HW1 is online!
|Due date by 27.4, submission in pairs.|
Submission could be either electronic or hard copy to Ohad's cell on the 5th floor.
Guest Lecture and more...
This week (6/4) there will be a guest lecture by Gilad Kutiel. The lecture topic will be Edmonds algorithm for finding maximum matchings.
The lecture will take place at Taub 6 as usual at 10:30-11:30.
Instead of the second part of the lecture, there will be an additional tutorial, which means that there will be two hours of tutorial this week (11:30-12:30, 13:30-14:30).
In addition, the first assignment is expected to be published by the end of the week, and the is expected to be due two weeks after Passover vacation.
Have a good day,
Lecture instead of tutorial
Seffi will hold another lecture hour, tomorrow (30/3) at 13:30-14:30 instead of the tutorial.
Welcome to Algorithms 2!
|Next week (23/3) Tutorial will be a review for the last part of Algorithms 1 course, so it will take place in 10:30 instead of 13:30. The lecture will take place right after- 11:30-13:30.|
If you have any problem attending to the second hour (12:30-13:30) please contact Ohad and we will try to come up with a solution.
Next week the tutorial will take place as usual at 13:30, and the lecture at 10:30-12:30.
Tutorial 1 has already been uploaded under 'Course Materials'.