Design and analysis of approximation algorithms / Ding-Zhu Du, Ker-I Ko, Xiaodong Hu.

By:

Du, Dingzhu

Contributor(s):

Material type: Text

TextSeries: Publication details: New York, NY : Springer, c2012.Description: xi, 440 p. : illISBN:

9781461417002 (alk. paper)
1461417007 (alk. paper)
9781461417019 (eISBN)

Subject(s):

Approximation algorithms

DDC classification:

516.00285 DIN

Contents:

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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
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

Browsing Dept. of Futures Studies shelves, Shelving location: Processing Center Close shelf browser (Hides shelf browser)

Previous								Next
Previous	515.7242 MEL Geometric scattering theory /	516 SHA Explorations in geometry /	516 SOL Lectures on convex sets /	516.00285 DIN Design and analysis of approximation algorithms /	516.08 VEL Theory of convex structures /	516.3 TRI Curves and fractal dimension /	518 NEA Foundations of algorithms /	Next

Includes bibliographical references (p. 407-424) and index.

There are no comments on this title.

to post a comment.