Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. S.H. Bokhari. Assignment Problems in Parallel and Distributed Computation. Kluwer, Boston, 1987.
2. V. Chvátal. Linear Programming. W.H. Freeman and Co., San Francisco (1983).
3. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. 25th Annual Symposium on Foundations of Computer Science, Singer Island (October 1984), 255–259.
4. M.J. Eisner and D.G. Severance. Mathematical techniques for efficient record segmentation in large shared databases. J. Assoc. Comput. Mach., 23:619–635, 1976.
5. D. Fernández-Baca and S. Srinivasan. Constructing the minimization diagram of a two-parameter problem. Tech. Report 90-01, Department of Computer Science, Iowa State University, January 1990. To appear in Operations Research Letters.