An edition of Design and analysis of approximation algorithms
(2012)
Design and analysis of approximation algorithms
by Dingzhu Du
- 1 Want to read
Share
×Close
This work doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
| Edition | Availability |
|---|---|
1
|
aaaa
|
Book Details
Table of 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.
Edition Notes
Includes bibliographical references (p. 407-424) and index.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
| December 13, 2022 | Edited by MARC Bot | import existing book |
| August 22, 2020 | Edited by ImportBot | import existing book |
| August 2, 2020 | Edited by ImportBot | import existing book |
| June 29, 2019 | Edited by MARC Bot | import existing book |
| April 13, 2012 | Created by LC Bot | import new book |