MA 618 -- COMBINATORICS AND NETWORKS
MWF 10:00-10:50 -- CB345
INSTRUCTOR: Carl Lee, 967 POT, 257-1405, email@example.com,
OFFICE HOURS: MWF 9:00-9:50 and by appointment, since I
realize that some of you will be unable to come at these times.
TEXT: Jon Lee, The Foundations of Combinatorial
Matroids and the Greedy Algorithm
Branch and Bound
Optimizing Submodular Functions
HOMEWORK: There will be frequent homework assignments, but not
on a set schedule--usually problems will be assigned as they are
encountered in the text.
Problems are assigned to be
solved. Searching the textbooks or the library for solutions is not
permitted. On regular assignments you may discuss the problems with
other current class members and with me, but not with anyone else.
However, when it comes time for you to write up the solutions, I
expect you to do this on your own. If you receive assistance from
another class member, include a written acknowledgment. Such an
acknowledgment is a professional courtesy and will not affect your
EXAMS: There will be two or three exams and a final exam.
The date for the final exam is
Tuesday, May 2, 10:30 am - 12:30 pm, CB345
OTHER IMPORTANT DATES:
Wednesday, January 12 -- First day of classes
Monday, January 17 -- Martin Luther King, Jr., birthday, academic holiday
Wednesday, January 19 -- Last day to add a course
Wednesday, February 2 -- Last day to drop a course without a grade
Monday, March 6 -- Middle of the spring semester
Friday, March 10 -- Last day to withdraw from a course
Monday-Saturday, March 13-18 -- Spring vacation, academic holiday
Friday, April 28 -- Last day of classes
CHEATING AND PLAGIARISM: The minimum University penalty for cheating and/or plagiarism is a grade of E for the entire course. It's not worth it and it is damaging to your self-integrity, so don't do it.