This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Kapitel 4
A. V. Aho, J. E. Hopcroft und J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
E. Horowitz, S. Sahni und S. Rajasekaran, Computer Algorithms, Computer Science Press, 1997.
T. H. Cormen, C. E. Leiserson, R. L. Rivest und C. Stein, Algorithmen — Eine Einführung, Oldenbourg-Verlag, 2004.
S. Baase und A. Van Gelder, Computer Algorithms: Introduction to Design and Analysis, 3. Auflage, Addison-Wesley, 1999.
D. Kozen, The Design and Analysis of Algorithms, Springer-Verlag, 1992.
U. Manber, Introduction to Algorithms: A Creative Approach, Addison-Wesley, 1989.
A. V. Aho und J. D. Ullman, Foundations of Computer Science, W. H. Freeman & Co., 1995.
M. Sipser, Introduction to the Theory of Computation, Brooks Cole, 1996.
G. Brassard und P. Bratley, Fundamentals of Algorithmics, Prentice-Hall, 1995.
R. G. Dromey, How to Solve it by Computer, Prentice-Hall, 1982.
S. Even, Graph Algorithms, Computer Science Press, 1979.
G. H. Gonnet, Handbook of Algorithms and Data Structures, Addison-Wesley, 1984.
T. C. Hu und M. T. Shing, Combinatorial Algorithms, Dover Publications, 2002.
K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer-Verlag, 1984.
K. Mehlhorn,Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, Springer-Verlag, 1987.
K. Mehlhorn,Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry, Springer-Verlag, 1990.
D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3. Auflage, Addison-Wesley, 1997.
D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 3. Auflage, Addison-Wesley, 1997.
D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, 2. Auflage, Addison-Wesley, 1998.
E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Dover Publications, 2001.
C. H. Papadimitriou und K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1982.
E. M. Reingold Combinatorial Algorithms: Theory and Practice, Prentice-Hall, 1977.
R. Sedgewick und P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, 1995.
R. E. Tarjan, Data Structures and Network Algorithms, CBMS-NSF Regional Conf. Series in Appl. Math., SIAM Press, 1983.
F. P. Preparata und M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 1991.
F. F. Yao, „Computational Geometry,“ in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 343–89.
R. C. Prim, „Shortest Connection Networks and Some Generalizations,“ Bell Syst. Tech. J. 36 (1957), S. 1389–401.
J. B. Kruskal, Jr., „On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,“ Proc. Amer. Math. Soc. 7 (1956), S. 48–50.
E. W. Dijkstra, „A Note on Two Problems in Connexion with Graphs,“ Numerische Mathematik 1 (1959), S. 269–71.
R. L. Graham und P. Hell, „On the History of The Minimal Spanning Tree Problem,“ Ann. Hist. Comput. 7 (1985), S. 43–57.
R. E. Bellman, Dynamic Programming, Princeton University Press, 1957 (Paperback, Dover Publications, 2003).
S. E. Dreyfus und A. M. Law, The Art and Theory of Dynamic Programming, Academic Press, 1977.
D. Bertsekas, Dynamic Programming and Optimal Control, 2. Auflage, Athena Scientific, 2001.
R. E. Tarjan, „Depth First Search and Linear Graph Algorithms,“ SIAM J. Comput. 1 (1972), S. 146–60.
J. E. Hopcroft und R. E. Tarjan, „Efficient Algorithms for Graph Manipulation,“ Comm. Assoc. Comput. Mach. 16 (1973), S. 372–8.
T. H. Cormen, C. E. Leiserson, R. L. Rivest und C. Stein, Algorithmen — Eine Einführung, Oldenbourg-Verlag, 2004.
J. van Leeuwen, „Graph Algorithms,“ in Handbook of Theoretical Computer Science,Vol. A, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 525–631.
C. Okasaki, Purely Functional Data Structures, Cambridge University Press, 1998.
A. Borodin und R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Algorithmische Methoden. In: Algorithmik. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-37437-X_4
Download citation
DOI: https://doi.org/10.1007/3-540-37437-X_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24342-7
Online ISBN: 978-3-540-37437-4
eBook Packages: Life Science and Basic Disciplines (German Language)