000			03120cam a2200253 a 4500
001			vtls000008244
003			VRT
005			20250102223935.0
008			090620s1998 caua |b 001 0 eng
020			_a0387948600 (hardcover : alk. paper)
039		9	_a201604251114 _baalzain _c201402040157 _dVLOAD _c201005220843 _dmalmash _c200906200840 _dvenkatrajand _y200906200839 _zvenkatrajand
050			_aQA76.9.A43 _bS55 1998
100	1		_aSkiena, Steven S. _932758
245	1	0	_aThe Algorithm Design Manual / _cSteven S. Skiena.
260			_aSanta Clara, CA : _bTELOS--the Electronic Library of Science, _cc1998.
300			_axvi, 486 p. : _bill. ; _c25 cm. + _e1 computer laser optical disc (4 3/4 in.).
504			_aIncludes bibliographical references (p. [439]-462) and index.
505	1		_aPart I: Techniques 1) Introduction to Algorithms; 2) Data Structures and Sorting; 3) Breaking Problems Down; 4) Graph Algorithms; 5) Combinatorial Search and Heuristic Methods; 6) Intractable Problems and Approximations; 7) How to Design Algorithms Part II: Resources 8) A Catalog of Algorithmic Problems; 9) Algorithmic Resources
520			_aThis material has been developed over a period of several years in an upper-division course taught to computer science students at SUNY, Stony Brook, by Steve Skiena. A major goal of the author has been to take some of the mystery out of identifying and dealing with algorithms which these students will later use in the workplace, drawing heavily on the author's own real-world experiences, the book stressing design and analysis. Thus the work takes on a very practical character, as reflected in its title: Manual. The Book is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, comprising the catalog of algorithmic resources, implementations, and an extensive bibliography. The primary audience for this book/CD-ROM combination is the working professional who uses algorithms on a daily basis and has need for a handy reference.A major feature of this book is the inclusion of a complete catalog of important algorithmic problems.By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. Nothing like this catalog exists in the computing literature for general computer algorithms. This work can also readily be used as a course supplement or adjunct text in standard courses on algorithm design, or simply as a student reference guide, as the author puts it. Pedagogic features include pen-and-paper exercises, team projects, independent student projects, take home lessons (goals) at the beginning of chapters. Other teaching and learning aids reside on the accompanying CD-ROM.
650		0	_aComputer algorithms. _911289
856	4		_3Publisher description _uhttp://www.loc.gov/catdir/enhancements/fy0815/97020712-d.html
856	4		_3Table of contents only _uhttp://www.loc.gov/catdir/enhancements/fy0815/97020712-t.html
942			_2lcc _n0 _cBK
999			_c14273 _d14273