On the Complexity of Timetable and Multicommodity Flow Problems

  title={On the Complexity of Timetable and Multicommodity Flow Problems},
  author={S. Even and A. Itai and A. Shamir},
  journal={SIAM J. Comput.},
  • S. Even, A. Itai, A. Shamir
  • Published 1976
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 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

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    A polynomial time approximation algorithm for the two-commodity splittable flow problem
    Preassignment Requirements in Chromatic Scheduling
    • 8
    • Open Access
    Restrictions and Preassignments in Preemptive open Shop Scheduling
    • 21
    • Highly Influenced
    • Open Access
    Hierarchical Flow
    • 9
    • Highly Influenced
    Incremental flow
    • 1
    A branch-and-price algorithm for a hierarchical crew scheduling problem
    • 13
    • Open Access