|Title:||On The Complexity Of Timetable And Integral Multi-commodity Plow Problems
|Authors:||S.Even and A. Shamir
|Abstract:||A very primitive version of Got1ieb's timetable problem is shown to be NP-complete, and therefore all the common timetable problems are NP-complete. A polynomial time algorithm, 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 problem is shown to be NP-complete even if the number of commodities is 3. This is true both in the directed and undirected cases. Finally, a simple reduction to the 3 dimensional matching problem is given.|
|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/1974/CS/CS0041), 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 1974
To the main CS technical reports page
Computer science department, Technion