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.
KeywordsMinimum Span Tree Voronoi Diagram Computational Geometry Combinatorial Algorithm Intend Primar
Unable to display preview. Download preview PDF.
- [BvG99]S. Baase and A. van Gelder. Computer Algorithms. Addison-Wesley, Reading MA, third edition, 1999.Google Scholar
- [GBY91]G. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, Wokingham, England, second edition, 1991.Google Scholar
- [Law76]E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, Fort Worth TX, 1976.Google Scholar
- [MN99]K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.Google Scholar
- [MS91]B. Moret and H. Shapiro. Algorithm from P to NP: Design and Efficiency. Benjamin/Cummings, Redwood City, CA, 1991.Google Scholar
- [PS98]C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, 1998.Google Scholar
- [Raw92]G. Rawlins. Compared to What? Computer Science Press, New York, 1992.Google Scholar
- [SLL02]J. Siek, L. Lee, and A. Lumsdaine. The Boost Graph Library: user guide and reference manual. Addison Wesley, Boston, 2002.Google Scholar
- [SR03]S. Skiena and M. Revilla. Programming Challenges: The Programming Contest Training Manual. Springer-Verlag, 2003.Google Scholar
- [vL90b]J. van Leeuwen, editor. Handbook of Theoretical Computer Science: Algorithms and Complexity, volume A. MIT Press, 1990.Google Scholar