| 000 | 02860nam a22004815i 4500 | ||
|---|---|---|---|
| 001 | 978-1-4614-1701-9 | ||
| 003 | DE-He213 | ||
| 005 | 20140220083243.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 111117s2012 xxu| s |||| 0|eng d | ||
| 020 |
_a9781461417019 _9978-1-4614-1701-9 |
||
| 024 | 7 |
_a10.1007/978-1-4614-1701-9 _2doi |
|
| 050 | 4 | _aQA402.5-402.6 | |
| 072 | 7 |
_aPBU _2bicssc |
|
| 072 | 7 |
_aMAT003000 _2bisacsh |
|
| 082 | 0 | 4 |
_a519.6 _223 |
| 100 | 1 |
_aDu, Ding-Zhu. _eauthor. |
|
| 245 | 1 | 0 |
_aDesign and Analysis of Approximation Algorithms _h[electronic resource] / _cby Ding-Zhu Du, Ker-I Ko, Xiaodong Hu. |
| 264 | 1 |
_aNew York, NY : _bSpringer New York, _c2012. |
|
| 300 |
_aXII, 440 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSpringer Optimization and Its Applications, _x1931-6828 ; _v62 |
|
| 505 | 0 | _aPreface -- 1. Introduction -- 2. Greedy Strategy -- 3. Restriction -- 4. Partition -- 5. Guillotine Cut -- 6. Relaxation -- 7. Linear Programming -- 8. Primal-Dual Scheme and Local Ratio -- 9. Semidefinite Programming -- 10. Inapproximability -- Bibliography -- Index. | |
| 520 | _aWhen precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for researchers in the area of design and analysis algorithms. There are few texts available for this standard course, and those that do exist mainly follow a problem-oriented format. This text follows a structured, technique-oriented presentation. Approximation algorithms are organized into chapters based on the design techniques for the algorithms, enabling the reader to study algorithms of the same nature with ease, and providing an improved understanding of the design and analysis techniques for approximation algorithms. Instructors benefit from this approach allowing for an easy way to present the ideas and techniques of algorithms with a unified approach. | ||
| 650 | 0 | _aMathematics. | |
| 650 | 0 | _aComputer software. | |
| 650 | 0 | _aMathematical optimization. | |
| 650 | 1 | 4 | _aMathematics. |
| 650 | 2 | 4 | _aOptimization. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 700 | 1 |
_aKo, Ker-I. _eauthor. |
|
| 700 | 1 |
_aHu, Xiaodong. _eauthor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9781461417002 |
| 830 | 0 |
_aSpringer Optimization and Its Applications, _x1931-6828 ; _v62 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-1-4614-1701-9 |
| 912 | _aZDB-2-SMA | ||
| 999 |
_c101122 _d101122 |
||