Verwandte Artikel zu Design and Analysis of Approximation Algorithms: 62...
Design and Analysis of Approximation Algorithms: 62 (Springer Optimization and Its Applications) - Hardcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den 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.
Von der hinteren Coverseite
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum2011
- ISBN 10 1461417007
- ISBN 13 9781461417002
- EinbandTapa dura
- SpracheEnglisch
- Anzahl der Seiten454
- Kontakt zum HerstellerNicht verfügbar
EUR 102,66
EUR 29,66 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 48,37
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Design and Analysis of Approximation Algorithms: 62...
Foto des Verkäufers
Design and Analysis of Approximation Algorithms
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Gebunden. Zustand: 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 . Bestandsnummer des Verkäufers 4197206
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Design and Analysis of Approximation Algorithms
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9781461417002
Anzahl: 2 verfügbar
Foto des Verkäufers
Design and Analysis of Approximation Algorithms
Verlag:
Springer New York, Springer New York Nov 2011, 2011
ISBN 10: 1461417007
ISBN 13: 9781461417002
Neu
Hardcover
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. 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. Bestandsnummer des Verkäufers 9781461417002
Anzahl: 2 verfügbar
Foto des Verkäufers
Design and Analysis of Approximation Algorithms
Verlag:
Springer New York, Springer US, 2011
ISBN 10: 1461417007
ISBN 13: 9781461417002
Neu
Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Bestandsnummer des Verkäufers 9781461417002
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Design and Analysis of Approximation Algorithms
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 454. Bestandsnummer des Verkäufers 184321335
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Design and Analysis of Approximation Algorithms
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 454 Index. Bestandsnummer des Verkäufers 264321341
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Design and Analysis of Approximation Algorithms
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 440 pages. 9.25x6.25x1.25 inches. In Stock. Bestandsnummer des Verkäufers x-1461417007
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Design and Analysis of Approximation Algorithms
Print-on-DemandAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Print on Demand pp. 454 Illus. Bestandsnummer des Verkäufers 3559394
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications, Vol. 62)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9781461417002_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications, Vol. 62)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar2716030035394
Anzahl: Mehr als 20 verfügbar