Abstract
This presents a generic algorithm to obtain a minimum sized partition of a partially ordered set into chains. The algorithm is illustrated with three examples, including a novel box stacking problem and solution.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35672-3_13
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Alt, N. Blum, K. Mehlhorn, M. Paul. Computing a maximum cardinality matching in a bipartite graph in time 0(n1.5,\/m1 log n). Information Processing Letters, 37 (4): 237–240, 1991.
R. S. Bird. The smallest upravel. Science of Computer Programming, 18: 28 1292, 1992.
R.S. Bird, O. de Moor. Algebra of Programming. Prentice Hall, 1997.
G. B. Dantzig, D. R. Fulkerson. Minimizing the number of tankers to meet a fixed schedule. Naval Research Logistics Quarterly, 1: 217–222, 1954.
R. P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51 (2): 161–166, 1950.
L.R. Ford, D.R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
U.I. Gupta, D.T. Lee, J.Y. Leung. An optimal solution for the channel-assignment problem. IEEE Transactions on Computers, 28 (11): 807–810, November 1979.
I. Gertsbakh, H.I. Stern. Minimal resources for fixed and variable job schedules. Operations Research, 26: 68–85, 1978.
J. Hoperoft, R. Karp. An n512 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2 (4): 225–230, December 1973.
Stephen Wolfram. Mathematica: A System for Doing Mathematics by Computer. Addison-Wesley, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Curtis, S.A. (2003). A Generic Algorithm for Minimum Chain Partitioning. In: Gibbons, J., Jeuring, J. (eds) Generic Programming. IFIP — The International Federation for Information Processing, vol 115. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35672-3_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-35672-3_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5320-2
Online ISBN: 978-0-387-35672-3
eBook Packages: Springer Book Archive