CS 466/666, Fall 2011
Advanced Algorithms
Skip to assignments
Announcements:
- (Dec 8, 2011) A5 has been graded. The grades are posted on UWACE.
You can pick up your assignments during office hours.
- (Dec 2, 2011) The Fall 2009 final is available from UWACE.
Normal office hours will continue until the final.
I will hold extra office hours on Fri, 12/9, 9:30-10:30 and
Mon, 12/12, 10-11. (Note the small time change for Friday
from what I said in class.)
- (Nov 17, 2011) A5 is now posted. It is due December 1 (Thursday)
at 5pm.
- (Nov 15, 2011) By popular request, I (very quickly) typed up
some notes concerning independent
set in hexagonal grid graphs. These were written in a hurry and
likely contain some small errors, but hopefully will help clarifying
the material at least a bit.
- (Nov 11, 2011) And a small correction for A4, Q3(c): "2m" should
have been "4m" in the last line.
- (Nov 9, 2011) Two clarifications for A4, Q1: The algorithm should
be a 2-approximation with regards to the radius, and it should be
deterministic.
- (Oct 24, 2011) The midterm exam will take place on Thursday, Oct 27,
at class time but in a different room. Please all come to DWE 2527.
- (Oct 19, 2011) Our final exam will take place on Monday, Dec 12,
from 12:30-3pm in MC4059.
- (Oct 17, 2011) Shahin unfortunately had to miss his office hours
today, but will make up for them tomorrow (9:30-10:30.) The assignments
will be available then, and also tomorrow in class.
- (Oct 14, 2011) The graded assignment 1 will be available in
Jakub's office hours (today, 11-12, DC2501.)
- (Oct 14, 2011) As for the A1 solutions: Apparently the library needs
FOREVER to "review" those before adding them to course resources. (It's
been 7 days.) So, rather grudgingly, I've requrested a UW-ACE page for
cs466/666, and uploaded the solutions there, under "Lessons". The
following link may or may not work for you, or search on
UW-ACE. You need to be a
registered student to access the ACE pages for cs466/666.
- (Oct 13, 2011) The midterm from two years ago is available
in PS/PDF.
- (Oct 11, 2011) Due to a scheduling conflict, my office hours tomorrow
(Oct 12, 10-11) are CANCELLED. I will hold extra office hours on Thursday
(Oct 13), 10-11.
- (Oct 7, 2011) Solution sketches for Assignment 1 are available
from the Course Reserves
page of the library.
- (Oct 6, 2011) There was an error in Question 4 of A2, which trivialized
the question. This has now been corrected.
- (Sep 28, 2011) I am (very slowly) adding some lecture notes for this
course to the Topics page. Available
so far is the intro (Vertex Cover), and the lower bound for selection.
There is no guarantee that future lecture notes will appear in
time for the topics!
- (Sep 26, 2011) Two clarifications for A1: CleanUp is the method that achieves that a binomial heap has no duplicate root-degree, and for Q4 assume that no three points are on a line. A modified assignment has been posted.
- (Sep 21, 2011) A1 is now posted (see below.)
- (Sep 12, 2011) Office hours have now been posted. They will start
in the week of Sept. 19.
- (Sept 1, 2011) The course is currently full (and hence closed in Quest.)
If you want to enroll anyway, please go to
the CS waiting list and add yourself to CS466. (Graduate
students, please leave a comment that you want CS666 with the
comments.)
Decisions as to who will be allowed into the course will be
taken by the CS advisors.
Instructor:
Therese Biedl
(DC2341, x34721, biedl "at" cs),
office hrs: Wed 10-11, or email me to make an appointment.
Meeting Time/Place:
Tue & Thu 1:00-2:20, DWE3516
TAs: Shahin Kamali (DC2305, x35328, s3kamali "at" cs), office hrs:
Mon 9:30-10:30
Jakub Truszkowski (DC2501, x36612, jmtruszk "at" cs), office hrs: Fri 11-12
Course Work:
[Solutions hints to the assignments
will be put on reserve in the DC library]