This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S.H. Bokhari. Assignment Problems in Parallel and Distributed Computation. Kluwer, Boston, 1987.
V. Chvátal. Linear Programming. W.H. Freeman and Co., San Francisco (1983).
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.
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.
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.
M. Garey and D. Johnson. Computers and Intractability: A Guide to the theory of NP-Completeness. Freeman, San Francisco, 1979.
G. Gallo, M.D. Grigoriades, and R.E. Tarjan. A fast parametric maximum flow algorithm and its applications. SIAM J. Computing, 18(1):30–55, 1989.
D. Gusfield. Parametric combinatorial computing and a problem in program module allocation. J. Assoc. Comput. Mach., 30(3):551–563, July 1983.
C.P.M. van Hoesel, A.W.J. Kolen, A.H.G. Rinooy Kan, and A.P.M. Wagelmans, Sensitivity analysis in combinatorial optimization: a bibliography. Report 8944/A, Econometric Institute, Erasmus University Rotterdam, 1989.
W.K. Klein Haneveld, C.L.J. van der Meer, and R.J. Peters. A construction method in parametric programming. Mathematical Programming, 16:21–36, 1979.
N. Megiddo. Combinatorial optimization with rational objective functions. Math. Oper. Res., 4:414–424, 1979.
N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach., 30(4):852–865, 1983.
N. Megiddo. Dynamic location problems. IBM Almaden Research Center, Tech. Report RJ 4983, 1986.
C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
F.P. Preparata and R. Tamassia. Efficient point location in a convex spatial cell complex. Technical Report No. CS-89-47, Department of Computer Science, Brown University, December 1989. A preliminary version appeared in Algorithms and Data Structures, F. Dehne et al., eds, Lecture Notes in Computer Science 382, Springer-Verlag, Berlin, 1989, pp. 3–11.
J. Schwartz and M. Sharir. On the two-dimensional Davenport-Schinzel problem. Technical Report 193, NYU Courant Institute of Mathematical Sciences, August 1987.
N. Sarnak and R.E. Tarjan. Planar point location using persistent search trees. Communications ACM, 29:669–679, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández-Baca, D. (1990). Space-sweep algorithms for parametric optimization. In: Gilbert, J.R., Karlsson, R. (eds) SWAT 90. SWAT 1990. Lecture Notes in Computer Science, vol 447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52846-6_95
Download citation
DOI: https://doi.org/10.1007/3-540-52846-6_95
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52846-3
Online ISBN: 978-3-540-47164-6
eBook Packages: Springer Book Archive