Algorithmic Resources

Abstract

This chapter briefly describes resources that the practical algorithm designer should be familiar with. Although some of this information has appeared elsewhere in the catalog, the most important pointers are collected here for general reference.

Keywords

Minimum Span Tree Voronoi Diagram Computational Geometry Combinatorial Algorithm Intend Primar 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [AHU74]
    A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading MA, 1974.MATHGoogle Scholar
  2. [AHU83]
    A. Aho, J. Hopcroft, and J. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading MA, 1983.MATHGoogle Scholar
  3. [BR95]
    A. Binstock and J. Rex. Practical Algorithms for Programmers. Addison-Wesley, Reading MA, 1995.MATHGoogle Scholar
  4. [BvG99]
    S. Baase and A. van Gelder. Computer Algorithms. Addison-Wesley, Reading MA, third edition, 1999.Google Scholar
  5. [CLRS01]
    T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge MA, second edition, 2001.MATHGoogle Scholar
  6. [GBY91]
    G. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, Wokingham, England, second edition, 1991.Google Scholar
  7. [Knu94]
    D. Knuth. The Stanford GraphBase: a platform for combinatorial computing. ACM Press, New York, 1994.MATHGoogle Scholar
  8. [Law76]
    E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, Fort Worth TX, 1976.Google Scholar
  9. [Man89]
    U. Manber. Introduction to Algorithms. Addison-Wesley, Reading MA, 1989.MATHGoogle Scholar
  10. [MN99]
    K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.Google Scholar
  11. [MS91]
    B. Moret and H. Shapiro. Algorithm from P to NP: Design and Efficiency. Benjamin/Cummings, Redwood City, CA, 1991.Google Scholar
  12. [NW78]
    A. Nijenhuis and H. Wilf. Combinatorial Algorithms for Computers and Calculators. Academic Press, Orlando FL, second edition, 1978.MATHGoogle Scholar
  13. [PS98]
    C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, 1998.Google Scholar
  14. [PS03]
    S. Pemmaraju and S. Skiena. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, New York, 2003.MATHGoogle Scholar
  15. [Raw92]
    G. Rawlins. Compared to What? Computer Science Press, New York, 1992.Google Scholar
  16. [Rei91]
    G. Reinelt. TSPLIB – a traveling salesman problem library. ORSA J. Computing, 3:376–384, 1991.MATHGoogle Scholar
  17. [SDK83]
    M. Syslo, N. Deo, and J. Kowalik. Discrete Optimization Algorithms with Pascal Programs. Prentice Hall, Englewood Cliffs NJ, 1983.MATHGoogle Scholar
  18. [SLL02]
    J. Siek, L. Lee, and A. Lumsdaine. The Boost Graph Library: user guide and reference manual. Addison Wesley, Boston, 2002.Google Scholar
  19. [SR03]
    S. Skiena and M. Revilla. Programming Challenges: The Programming Contest Training Manual. Springer-Verlag, 2003.Google Scholar
  20. [vL90b]
    J. van Leeuwen, editor. Handbook of Theoretical Computer Science: Algorithms and Complexity, volume A. MIT Press, 1990.Google Scholar
  21. [Wil89]
    H. Wilf. Combinatorial Algorithms: an update. SIAM, Philadelphia PA, 1989.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceState University of New York at Stony BrookNew YorkUSA

Personalised recommendations