Design and analysis of approximation algorithms / Ding-Zhu Du, Ker-I Ko, Xiaodong Hu.
Material type: TextSeries: Publication details: New York, NY : Springer, c2012.Description: xi, 440 p. : illISBN:- 9781461417002 (alk. paper)
- 1461417007 (alk. paper)
- 9781461417019 (eISBN)
- 516.00285 DIN
Item type | Current library | Home library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
Book | Dept. of Futures Studies Processing Center | Dept. of Futures Studies | 516.00285 DIN (Browse shelf(Opens below)) | Available | DFS3722 |
Includes bibliographical references (p. 407-424) and index.
1. Introduction -- 2. Greedy strategy -- 3. Restriction -- 4. Partition -- 5. Guillotine cut -- 6. Relaxation -- 7. Linear programming -- 8. Primal-dual schema and local ratio -- 9. Semidefinite programming -- 10. Inapproximability.
There are no comments on this title.