1. S. K. Baruah, R. R. Howell, and L. E. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor.Real-Time Systems, 2:301–324, 1990.
2. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection.Journal of Computer and System Sciences, 7:448–461, 1973.
3. X. Deng. Mathematical Programming: Complexity and Applications. Ph.D. thesis, Department of Operations Research, Stanford University, Stanford, CA, September 1989.
4. L. R. Ford, Jr., and D. R. Fulkerson.Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
5. M. R. Garey and D. S. Johnson.Computers and Intractability.A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.