Abstract
Let us start with two examples.
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
General Literature
Knuth, D.E. [1968]: The Art of Computer Programming; Vol. 1. Addison-Wesley, Reading 1968 (3rd edition: 1997)
Cited References
Aho, A.V., Hopcroft, J.E., and Ullman, J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974
Cobham, A. [1964]: The intrinsic computational difficulty of functions. Proceedings of the 1964 Congress for Logic Methodology and Philosophy of Science (Y. Bar-Hillel, ed.), North-Holland, Amsterdam 1964, pp. 24–30
Edmonds, J. [1965]: Paths, trees, and flowers. Canadian Journal of Mathematics 17 (1965), 449–467
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Korte, B., Vygen, J. (2002). Introduction. In: Combinatorial Optimization. Algorithms and Combinatorics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21711-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-21711-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-21713-9
Online ISBN: 978-3-662-21711-5
eBook Packages: Springer Book Archive