Abstract
The divide-and-conquer is an important technique for design of algorithms. In this chapter, we will employ several examples to introduce this technique, including the rectilinear minimum spanning tree, the Fibonacci search method, and the sorting problem. Sorting is not a combinatorial optimization problem. However, it appears in algorithms very often as a procedure, especially in algorithms for solving combinatorial optimization problems. Therefore, we would like to make more discussion in this chapter.
Defeat Them in Detail: The Divide and Conquer Strategy. Look at the parts and determine how to control the individual parts, create dissension and leverage it.
—Robert Greene
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
O. Boruvka: On a minimal problem, Prace Morask’e Pridovedeké Spolecnosti, 3: 37–58 (1926).
D. Cheriton and R.E. Tarjan: Finding minimum spanning trees, SIAM J. Comput., 5: 724–742 (1976).
G. Choquet: Etude de certains réseaux de routes, C R Acad Sci Paris, 205: 310–313 (1938).
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms, (3rd ed.), (MIT Press, 2009).
David E. Ferguson: Fibonaccian searching, Communications of the ACM, 3 (12): 648 (1960).
Leonidas J. Guibas, Jorge Stolfi: On computing all north-east nearest neighbors in the L 1 metric, Inf. Process. Lett., 17(4): 219–223 (1983).
M.T. Heideman, D. H. Johnson and C. S. Burrus: Gauss and the history of the fast Fourier transform, IEEE ASSP Magazine, 1(4): 14–21 (1984).
“Sir Antony Hoare”. Computer History Museum. Archived from the original on 3 April 2015. Retrieved 22 April 2015.
C. A. R. Hoare: Algorithm 64: Quicksort, Comm. ACM., 4(7): 321 (1961).
Luogen Hua: Exploratory of Optimal Selection, (Science Publisher, 1971).
F.K. Hwang, An \(O(n \log n)\) algorithm for rectilinear minimal spanning trees, J. ACM, 26: 177–182 (1979).
J. Kiefer: Sequential minimax search for a maximum, Proceedings of the American Mathematical Society, 4(3): 502–506 (1953).
Donald E. Knuth: The Art of Computer Programming: Volume 3, Sorting and Searching, second edition, (Addison-Wesley, 1998).
J.B. Kruskal: On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Sot., 7: 48–50 (1956).
D.T. Lee: Two-dimensional Voronoi diagrams in the L p metric, J. ACM, 27: 604–618 (1980).
D.T. Lee and C.K. Wang: Voronoi diagrams in L, (L,) metrics with 2-dimensional storage applications, SIAM J. Comput., 9: 200–211 (1980).
K. J. Overholt: Efficiency of the Fibonacci search method, BIT Numerical Mathematics, 13(1): 92–96 (1973).
R. C. Prim: Shortest connecting networks and some generahzattons, Bell Syst Tech J, 36: 1389–1401 (1957).
H. H. Seward: “Internal Sorting by Floating Digital Sort”, Information sorting in the application of electronic digital computers to business operations (PDF), Master’s thesis, Report R-232, Massachusetts Institute of Technology, Digital Computer Laboratory, pp. 25–28, 1954.
M. I. Shamos and D. Hoey: Closest point problems, Proceedings, 16th Annual Symp Foundations of Computer Science, pp 151–162, 1975.
A.C. Yao: On constructing minimum spanning trees in k-dimensional spaces and related problems, SIAM J. Comput., 11: 721–736 (1982).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Du, DZ., Pardalos, P., Hu, X., Wu, W. (2022). Divide-and-Conquer. In: Introduction to Combinatorial Optimization. Springer Optimization and Its Applications, vol 196. Springer, Cham. https://doi.org/10.1007/978-3-031-10596-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-10596-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-10594-4
Online ISBN: 978-3-031-10596-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)