• Bernhard Korte
  • Jens Vygen
Part of the Algorithms and Combinatorics book series (AC, volume 21)


Let us start with two examples.


Polynomial Time Combinatorial Optimization Problem Elementary Step Input Size Complete Enumeration 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


General Literature

  1. Knuth, D.E. [1968]: The Art of Computer Programming; Vol. 1. Addison-Wesley, Reading 1968 (3rd edition: 1997)MATHGoogle Scholar

Cited References

  1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974MATHGoogle Scholar
  2. 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–30Google Scholar
  3. Edmonds, J. [1965]: Paths, trees, and flowers. Canadian Journal of Mathematics 17 (1965), 449–467MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Bernhard Korte
    • 1
  • Jens Vygen
    • 1
  1. 1.Research Institute for Discrete MathematicsUniversity of BonnBonnGermany

Personalised recommendations