---

＜電子ブック＞
Design and Analysis of Approximation Algorithms / by Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
(Springer Optimization and Its Applications. ISSN:19316836 ; 62)

版	1st ed. 2012.
出版者	(New York, NY : Springer New York : Imprint: Springer)
出版年	2012
本文言語	英語
大きさ	XII, 440 p : online resource
著者標目	*Du, Ding-Zhu author Ko, Ker-I author Hu, Xiaodong author SpringerLink (Online service)
件　名	LCSH:Mathematical optimization LCSH:Algorithms FREE:Optimization FREE:Algorithms
一般注記	Preface -- 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 When 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 HTTP:URL=https://doi.org/10.1007/978-1-4614-1701-9

 類似資料