000			01896nam a2200229 4500
001			15328714
010			_a 2008931136 _z 2011941905
020			_a9781848000698
082	0	4	_a005.1 _bSKI/A
100	1		_aSkiena, Steven S
245	1	4	_aThe Algorithm design manual
250			_a2
260			_aLondon _bSpringer _c2008.
300			_axvi, 730p. _bill. ;
520			_aMost professional programmers that I've encountered are not well prepared to tacklealgorithmdesignproblems.Thisisapity, becausethetechniquesofalgorithm design form one of the core practical technologies of computer science. Designing correct, e?cient, and implementable algorithms for real-world problems requires access to two distinct bodies of knowledge: - Techniques - Good algorithm designers understand several fundamental - gorithm design techniques, including data structures, dynamic programming, depth-?rst search, backtracking, and heuristics. Perhaps the single most - portantdesigntechniqueismodeling, theartofabstractingamessyreal-world application into a clean problem suitable for algorithmic attack. - Resources - Good algorithm designers stand on the shoulders of giants. Ratherthanlaboringfromscratchtoproduceanewalgorithmforeverytask, they can ?gure out what is known about a particular problem. Rather than re-implementing popular algorithms from scratch, they seek existing imp- mentations to serve as a starting point. They are familiar with many classic algorithmic problems, which provide su?cient source material to model most any application. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both students and computer professionals.
650		0	_aComputer algorithms.
650		0	_aComputer science
650		0	_aAlgorithms
650		0	_aComputer Science and Engineerin
650		0	_aProgramming Algorithms
942			_cBK
999			_c76306 _d76306