| 书目名称 | Design and Analysis of Approximation Algorithms | | 编辑 | Ding-Zhu Du,Ker-I Ko,Xiaodong Hu | | 视频video | | | 概述 | The technique-oriented approach provides a unified view of the design techniques for approximation algorithms.Detailed algorithms, as well as complete proofs and analyses, are presented for each techn | | 丛书名称 | Springer Optimization and Its Applications | | 图书封面 |  | | 描述 | This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques | | 出版日期 | Textbook 2012 | | 关键词 | NP-completeness; approximation algorithms; combinatorial optimization; greedy algorithms; linear program | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4614-1701-9 | | isbn_softcover | 978-1-4899-9844-6 | | isbn_ebook | 978-1-4614-1701-9Series ISSN 1931-6828 Series E-ISSN 1931-6836 | | issn_series | 1931-6828 | | copyright | Springer Science+Business Media, LLC 2012 |
The information of publication is updating
|
|
发表于 2025-3-21 18:47:01
