Scheduling classes on a college campus

Computational Optimization and Applications

Volumn 16, Issue 3, 2000, Pages 279-294

  Fizzano, Perry ^a   Swanson, Steven ^a  

^a UNIVERSITY OF PUGET SOUND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; SCHEDULING;

BIPARTITE MATCHING; NON-BIPARTITE MATCHING;

ALGORITHMS;

EID: 0034273757     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008720430012     Document Type: Article

References (13)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall, 1993.
2. M. Carter and C. Tovey, "When is the classroom assignment problem hard?" Operations Research, vol. 40, supp 1, pp. S28-S39, 1992.
3. X. Deng, H. Liu, J. Long, and B. Xiao, "Competitive analysis of network load balancing," Journal of Parallel and Distributed Computing, vol. 40, no. 2, pp. 162-172, 1997.
4. J. Ferland and S. Roy, "Timetabling problem for university as assignment of activities to resources," Computers and Operations Research, vol. 12, no. 2, pp. 207-218, 1985.
5. J. Ferland, S. Roy, and T. Loc, "The timetabling problem," in OR Models on Microcomputers, 1986, pp. 97-103.
6. P. Fizzano, "Centralized and distributed algorithms for network scheduling," PhD Thesis, Dartmouth College, 1995.
7. M.L. Fredman and R.E. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms," Journal of the ACM, vol. 34, pp. 596-615, 1987.
8. D. Gale and L.S. Shapley, "College admissions and the stability of marraige," American Mathematical Monthly, vol. 69, pp. 9-14, 1962.
9. D. Gusfield and R.W. Irving, The Stable Marraige Problem: Structure and Algorithms, MIT Press, 1989.
10. D. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS, 1997.
11. B. Hoppe and E. Tardos, "The quickest transhipment problem," in Proceedings of the 6th Annual Symposium on Discrete Algorithms, 1995.
12. Max Planck Institute for Computer Science, "Leda, the library of efficient data structures and algorithms," v. 3.1, 1995.
13. S. Micali and V.V. Vazirani, "An O(√|v| · |E|) algorithm for finding maximum matching in general graphs," in 21st Annual Symposium on Foundations of Computer Science, 1980, pp. 17-27.