An Optimal Algorithm for the Maximum Three-Chain Problem
Abstract
Given a two-dimensional point set $\rho $, a chain C is a subset of $\rho $ in which for every two points one is dominated by the other. A k-chain is a subset of $\rho $ that can be partitioned into k-chains. The size of a k-chain is the total number of its points. A k-chain with maximum size, among all possible k-chains, is called a maximumk-chain. First geometric properties of k-chains are studied for an arbitrary k. Then a $\Theta (n\log n)$-time algorithm is presented for finding a maximum three-chain in a point set $\rho $, where $n = |\rho |$.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, The design and analysis of computer algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975x+470
2.
Mikhail J. Atallah, S. Rao Kosaraju, An efficient algorithm for maxdominance, with applications, Algorithmica, 4 (1989), 221–236
3.
J. Cong, C. L. Liu, On the k-layer planar subset and via minimization problems, IEEE Trans. Computer-Aided Design, 10 (1991), 972–981
4.
F. Gavril, Algorithms for maximum k-colorings and k-coverings of transitive graphs, Networks, 17 (1987), 465–470
5.
R. D. Lou, M. Sarrafzadeh, D. T. Lee, An optimal algorithm for the maximum two-chain problem, SIAM J. Discrete Math., 5 (1992), 285–304, in Proc. 1st SIAM-ACM Conference on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, Philadelphia, PA, 1990
6.
Franco P. Preparata, Michael Ian Shamos, Computational geometry, Texts and Monographs in Computer Science, Springer-Verlag, New York, 1985xii+390
7.
C. S. Rim, T. Kashiwabara, K. Nakajima, Exact algorithms for multilayer topological via minimization, IEEE Trans. Computer-Aided Design, 8 (1989), 1165–1184
8.
M. Sarrafzadeh, D. T. Lee, New approach to topological via minimization, IEEE Trans. Computer-Aided Design, 8 (1989), 890–900
9.
M. Sarrafzadeh, D. T. Lee, Topological via minimization revisited, IEEE Trans. Comput., 40 (1991), 1307–1312
10.
M. Sarrafzadeh, R. D. Lou, Maximum k-covering of weighted transitive graphs with applications, Algorithmica, 9 (1993), 84–100
Information & Authors
Information
Published In
Copyright
Copyright © 1993 © Society for Industrial and Applied Mathematics.
History
Submitted: 24 June 1991
Accepted: 9 June 1992
Published online: 31 July 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- If unsure, shuffleProceedings of the 2020 Genetic and Evolutionary Computation Conference | 26 June 2020
- Filter Sort Is $$\varOmega (N^3)$$ in the Worst CaseParallel Problem Solving from Nature – PPSN XVI | 2 September 2020
- An Efficient Nondominated Sorting Algorithm for Large Number of FrontsIEEE Transactions on Cybernetics, Vol. 49, No. 3 | 1 Mar 2019
- A PDE-based Approach to Nondominated SortingSIAM Journal on Numerical Analysis, Vol. 53, No. 1 | 8 January 2015
- A continuum limit for non-dominated sorting2014 Information Theory and Applications Workshop (ITA) | 1 Feb 2014
- A Hamilton--Jacobi Equation for the Continuum Limit of Nondominated SortingSIAM Journal on Mathematical Analysis, Vol. 46, No. 1 | 6 February 2014
- Maximum k-Chains in Planar Point Sets: Combinatorial Structure and AlgorithmsSIAM Journal on Computing, Vol. 28, No. 1 | 28 July 2006
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].