Abstract
A framework for solving certain multidimensional parametric search problems in randomized linear time is presented, along with its application to optimization on matroids, including parametric minimum spanning trees on planar and dense graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: Proceedings 39th IEEE Symp. on Foundations of Computer Science (1998)
Agarwal, P.K., Sharir, M.: Algorithmic techniques for geometric optimization. In: van Leeuwen, J. (ed.) Computer Science Today: Recent Trends and Developments. LNCS, vol. 1000. Springer, Heidelberg (1995)
Agarwal, P.K., Sharir, M., Toledo, S.: An efficient multidimensional searching technique and its applications. Technical Report CS-1993-20, Computer Science Department, Duke University (July 1993)
Agarwala, R., Fernández-Baca, D.: Weighted multidimensional search and its application to convex optimization. SIAM J. Computing 25, 83–99 (1996)
Camerini, P.M., Maffioli, F., Vercellis, C.: Multi-constrained matroidal knapsack problems. Mathematical Programming 45, 211–231 (1989)
Chazelle, B.: Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom. 9(2), 145–158 (1993)
Chazelle, B.: A faster deterministic algorithm for minimum spanning trees. In: Proceedings 38th IEEE Symp. on Foundations of Computer Science, pp. 22–31 (1997)
Chazelle, B., Friedman, J.: A deterministic view of random sampling and its use in geometry. Combinatorica 10(3), 229–249 (1990)
Clarkson, K.L.: Linear programming in \(O (n{\times}3^{{d}^{2}})\) time. Information Processing Letters 22, 21–24 (1986)
Cohen, E., Megiddo, N.: Maximizing concave functions in fixed dimension. In: Pardalos, P.M. (ed.) Complexity in Numerical Optimization, pp. 74–87. World Scientific, Singapore (1993)
Cole, R., Salowe, J.S., Steiger, W.L., Szemerédi, E.: An optimal-time algorithm for slope selection. SIAM J. Computing 18, 792–810 (1989)
Dyer, M.E.: On a multidimensional search technique and its application to the euclidean one-centre problem. SIAM J. Computing 15(3), 725–738 (1986)
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)
Eppstein, D.: Geometric lower bounds for parametric matroid optimization. Dis-crete Comput. Geom. 20, 463–476 (1998)
Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification — a technique for speeding up dynamic graph algorithms. J. Assoc. Comput. Mach. 44, 669–696 (1997)
Eppstein, D., Galil, Z., Italiano, G.F., Spencer, T.H.: Separator-based sparsification I: planarity testing and minimum spanning trees. J. Computing and Systems Sciences 52, 3–27 (1996)
Fernández-Baca, D., Slutzki, G.: Linear-time algorithms for parametric min- imum spanning tree problems on planar graphs. Theoretical Computer Science 181, 57–74 (1997)
Fernández-Baca, D., Slutzki, G.: Optimal parametric search on graphs of bounded tree-width. Journal of Algorithms 22, 212–240 (1997)
Fernández-Baca, D., Slutzki, G., Eppstein, D.: Using sparsification for parametric minimum spanning tree problems. Nordic Journal of Computing 34(4), 352–366 (1996)
Frederickson, G.N.: Optimal algorithms for partitioning trees and locating p-centers in trees. Technical Report CSD-TR 1029, Department of Computer Science, Purdue University, Lafayette, IN (October 1990)
Karger, D.R., Klein, P.N., Tarjan, R.E.: A randomized linear-time algorithm for finding minimum spanning trees. J. Assoc. Comput. Mach. 42, 321–328 (1995)
Klein, P.N., Rao, S., Rauch, M., Subramanian, S.: Faster shortest-path algorithms for planar graphs. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pp. 27–37 (1994)
Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4, 414–424 (1979)
Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach. 30(4), 852–865 (1983)
Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. Assoc. Comput. Mach. 34(1), 200–208 (1984)
Norton, C.H., Plotkin, S.A., Tardos, É.: Using separation algorithms in fixed dimension. Journal of Algorithms 13, 79–98 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández-Baca, D. (2000). Multi-parameter Minimum Spanning Trees. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_22
Download citation
DOI: https://doi.org/10.1007/10719839_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive