|Title:||On the Complexity of Timetable and Multi-commodity Flow Problems
|Authors:||S.Even, A.ltai and S.Shamir
|Abstract:||A very primitive version of Gotlieb's timetable problem is shown to be NP-complete, and therefore all the common timetable problems are NP-complete. A polynomial time algprithm, in case all teachers are binary, is shown. The theorem that a meeting function always exists if all teachers and classes have no time constraints is proved. The multi-commodity integral flow problem is shown to be NP-complete even if the number of commodities is two. This is true both in the directed and undirected cases.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1975/CS/CS0059), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1975
To the main CS technical reports page
Computer science department, Technion