000 | 00861nam#a2200181ua#4500 | ||
---|---|---|---|
008 | 230203 2012 | ||
020 | _a9781259025822 | ||
082 |
_a055.1 _bL51I |
||
100 |
_aLee, R.C.T _914633 |
||
245 |
_aIntroduction to the Design and Analysis of Algorithms _bA strategic approach _cby R.C.T. Lee and others |
||
260 |
_aNew Delhi _bMcGraw-Hill _c2012 |
||
300 | _axxv,723p. | ||
500 | _aPresents algorithm design from the viewpoint of strategies. Each strategy is introduced with many algorithms designed under the strategy. This book presents two important concepts: PTAS and NPO-complete and also discusses the concept of NP-completeness before introducing approximation algorithms. | ||
650 |
_aAlgorithmes, Computer algorithms _914634 |
||
700 |
_aTseng, S.S _914635 |
||
700 |
_aChang, R.C _914636 |
||
700 |
_aTsai, Y.T _914637 |
||
999 |
_c11078 _d11078 |