Design and Analysis of Approximation Algorithms: 62 (Springer Optimization and Its Applications) - Tapa dura
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
Ding-Zhu Du is co-editor of the first and soon-to-be published, second editions, of the Handbook of Combinatorial Optimization. He was also co-author with P.M. Pardalos and W. Wu of the Kluwer publication "Mathematical Theory of Optimization". Du will co-author upcoming Springer publications (2012) entitled "Connected Dominating Set: Theory and Applications" and "Introduction to Combinatorial Optimization". Prof. Du is also the EiC of the Journal of Combinatorial Optimization (Springer).
Ker-I Ko is a well known expert in the field of theoretical computer science. He has authored a single publication with Birkhauser "Computational Complexity of Real Functions" in 1991, with very good reviews. Prof. Du and Ker-I Ko have written several texts together including "Problem Solving in Automata, Languages, and Complexity" John Wiley, 2001; "Theory of Computational Complexity", John Wiley, 2000; Both of these books have received good reviews.
Xiaodong Hu is an expert in combinatorial optimization. He is a member of the editorial boards of Journal of Combinatorial Optimization and Discrete Mathematics, Algorithms and Applications.
De la contraportada
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Design and Analysis of Approximation Algorithms: 62...
Imagen de archivo
Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications, Vol. 62)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar2716030035394
Comprar nuevo
EUR 53,35
Gastos de envío:
EUR 3,43
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Design and Analysis of Approximation Algorithms
Publicado por
Springer New York Nov 2011, 2011
ISBN 10: 1461417007
ISBN 13: 9781461417002
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way. When exact solutions are difficult to compute, the use of approximation algorithms can help. 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. Even so, there are very few textbooks available for this course. Among those available in the market, most follow a problem-oriented format which is perhaps more convenient for researchers. This text follows a more structured, technique-oriented presentation. Approximation algorithms are organized into different chapters based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature, together. The structure of the text guides the reader to better understanding of the design and analysis techniques for approximation algorithms, and also helps the instructor to present the ideas and techniques of these algorithms in a more unified way.This textbook is intended for graduate students studying theoretical computer science. It can also be used as a reference work for researchers in the area of design and analysis of approximation algorithms. 452 pp. Englisch. Nº de ref. del artículo: 9781461417002
Comprar nuevo
EUR 53,49
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen de archivo
Design and Analysis of Approximation Algorithms
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 454 Index. Nº de ref. del artículo: 264321341
Comprar nuevo
EUR 79,38
Gastos de envío:
EUR 3,43
A Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Design and Analysis of Approximation Algorithms
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Print on Demand pp. 454 Illus. Nº de ref. del artículo: 3559394
Comprar nuevo
EUR 81,37
Gastos de envío:
EUR 7,44
De Reino Unido a Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Design and Analysis of Approximation Algorithms
Impresión bajo demandaLibrería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. PRINT ON DEMAND pp. 454. Nº de ref. del artículo: 184321335
Comprar nuevo
EUR 81,77
Gastos de envío:
EUR 9,95
De Alemania a Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Design and Analysis of Approximation Algorithms
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Brand New. 440 pages. 9.25x6.25x1.25 inches. In Stock. Nº de ref. del artículo: x-1461417007
Comprar nuevo
EUR 82,76
Gastos de envío:
EUR 14,31
De Reino Unido a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Design and Analysis of Approximation Algorithms
Impresión bajo demandaLibrería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The technique-oriented approach provides a unified view of the design techniques for approximation algorithmsDetailed algorithms, as well as complete proofs and analyses, are presented for each techniqueNumerous examples help the reader to . Nº de ref. del artículo: 4197206
Comprar nuevo
EUR 48,37
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications, Vol. 62)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9781461417002_new
Comprar nuevo
EUR 87,61
Gastos de envío:
EUR 13,71
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Design and Analysis of Approximation Algorithms
Publicado por
Springer New York, Springer New York Nov 2011, 2011
ISBN 10: 1461417007
ISBN 13: 9781461417002
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 452 pp. Englisch. Nº de ref. del artículo: 9781461417002
Comprar nuevo
EUR 53,49
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Design and Analysis of Approximation Algorithms
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Design and Analysis of Approximation Algorithms | Ding-Zhu Du (u. a.) | Buch | xii | Englisch | 2011 | Springer | EAN 9781461417002 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 106770266
Comprar nuevo
EUR 50,35
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles