000			03266cam a2200445 a 4500
001			ocn228582051
003			OCoLC
005			20240430145608.0
008			080421s2008 enka b 001 0 eng
010			_a 2008931136
015			_aGBA869339 _2bnb
015			_a07,N38,0779 _2dnb
016	7		_a014622134 _2Uk
020			_a9781848000698 (acidfree paper)
020			_a1848000693 (acid-free paper)
020			_z9781848000704 (e-ISBN)
035			_a(OCoLC)228582051
040			_aUKM _beng _cUKM _dYDXCP _dOHX _dBAKER _dCDX _dBWX _dBWK _dDLC _dZATUT _dCUS _dIQU _dU9S _dVP@ _dSPUDB _dDEBBG _dOCL _dDEBSZ _dUPP _dOCLCQ _dOCLCF _dOCLCQ
042			_aukblcatcopy _apcc
049			_aTSAA
090	0	0	_aQA 76.9.A43 _bS55 2008
100	1		_aSkiena, Steven S. _9102881
245	1	4	_aThe algorithm design manual / _cSteven S. Skiena.
250			_a2nd ed.
260			_aLondon : _bSpringer, _c©2008.
300			_axvi, 730 pages : _billustrations ; _c25 cm
500			_aPrevious edition: 1997.
504			_aIncludes bibliographical references (pages 665-707) and index.
505	0		_aPractical algorithm design: Introduction to algorithms ; Algorithm analysis ; Data structures ; Sorting and searching ; Graph traversal ; Weighted graph algorithms ; Combinatorial search and heuristic methods ; Dynamic programming ; Intractable problems and approximations ; How to design algorithms -- The hitchhiker's guide to algorithms ; A catalog of algorithmic problems ; Data structures ; Numerical problems ; Combinatorial problems ; Graph problems : polynomial-time ; Graph problems : hard problems ; Computational geometry ; Set and string problems ; Algorithmic resources.
520			_aThis expanded and updated second edition of a classic bestseller continues to take the mystery out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new war stories and interview problems, relating experiences from real-world applications. Unique, handy reference package with a practical, hands-on appeal to a wide audience This classic bestseller has been expanded and updated with twice the original tutorial material and exercises Contains a highly unique catalog of the 75 most important algorithmic problems Additional useful information such as lecture slides and updates available via author's website.
650		0	_aComputer algorithms. _9102884
650		6	_aAlgorithmes. _9102887
650	0	7	_aAlgorithmus. _2swd _9102889
650	0	7	_aComputer. _2swd _9102893
650	0	7	_aEntwurf. _2swd _9102895
907			_a41490 _b03-25-15 _c03-25-15
942			_cBOOK _01
998			_aaudmc _b03-25-15 _cm _da _e- _feng _genk _h4
945			_g0 _i5121548 _j0 _laudmc _o- _p331.00 _q- _r- _s- _t1 _u1 _v1 _w1 _x0 _yi15696546 _z03-25-15
999			_c41490 _d41490