# On the Complexity of Timetable and Multicommodity Flow Problems

@article{Even1976OnTC, title={On the Complexity of Timetable and Multicommodity Flow Problems}, author={S. Even and A. Itai and A. Shamir}, journal={SIAM J. Comput.}, year={1976}, volume={5}, pages={691-703} }

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 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 multicommodity 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… CONTINUE READING

1,068 Citations

Computational complexity of multicommodity flow problems with uniform assignment of flow

- Mathematics
- 1995

- 1

A polynomial time approximation algorithm for the two-commodity splittable flow problem

- Computer Science, Mathematics
- 2013

Restrictions and Preassignments in Preemptive open Shop Scheduling

- Mathematics, Computer Science
- 1996

- 21
- Highly Influenced
- Open Access

Complexity of some special types of timetabling problems Journal of Scheduling

- Computer Science
- 2002

- 29

Primal-dual approximation algorithms for integral flow and multicut in trees

- Mathematics, Computer Science
- 2006

- 335
- Open Access