Verwandte Artikel zu Approximation Algorithms

Vazirani, Vijay V. Approximation Algorithms ISBN 13: 9783540653677

Approximation Algorithms - Hardcover

 
9783540653677: Approximation Algorithms

Inhaltsangabe

Book by Vazirani Vijay V

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Críticas

From the reviews:

"Approximation algorithms is an area where much progress has been made in the last 10 years. The book under review is a very good help for understanding these results. In each of the 27 chapters an important combinatorial optimization problem is presented and one or more approximation algorithms for it are clearly and concisely described and analyzed. In this way most of the most important results from the approximation algorithm literature are covered, often more easily comprehensible than the original articles." (Viggo Kann, Zentralblatt MATH, Vol. 1005, 2003)

"The book under review concentrates on the ... design and analysis of efficient approximation algorithms with good performance guarantees. It is possibly the first textbook to provide an extensive and systematic coverage of this topic. ... The book starts briskly, using simple examples to illustrate some of the key concepts and draw the reader rapidly in. ... Copious exercises are included to test and deepen the reader’s understanding. ... It deserves a place in every computer science and mathematical library." (Mark R. Jerrum, Mathematical Reviews, 2002 h)

"The book of Vijay Vazirani is not the first one dedicated to approximation algorithms ... . However it is, I believe, among the very best from a didactical point of view: this is the text I would chose, would I have to give a course on approximation algorithms ... . I suspect that for many researchers it would be the first one to consult ... . It is a must acquisition for libraries of computer science/engineering departments ... ." (Francesco Maffioli, Mathematical Methods of Operations Research, Vol. 56 (2), 2002)

"The book gives an overview on the theory of approximation algorithms. It presents the most important problems, the basic methods and ideas which are used in this area. ... The book can be used for a graduate course on approximation algorithms. ... The chapters also contain a section of exercises, which can help the students to understand the material in a deeper way. ... On the other hand the book can be used by the researchers of the field ... ." (Csanád Imreh, Acta Scientiarum Mathematicarum, Vol. 68, 2002)

Reseña del editor

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

  • VerlagSpringer
  • Erscheinungsdatum2002
  • ISBN 10 3540653678
  • ISBN 13 9783540653677
  • EinbandTapa dura
  • SpracheEnglisch
  • Anzahl der Seiten404

Gebraucht kaufen

Zustand: Gut
Zustand: Gut - Gebrauchs- und Lagerspuren...
Diesen Artikel anzeigen

Gratis für den Versand innerhalb von/der Deutschland

Versandziele, Kosten & Dauer

EUR 5,92 für den Versand von Vereinigtes Königreich nach Deutschland

Versandziele, Kosten & Dauer

Weitere beliebte Ausgaben desselben Titels

9783642084690: Approximation Algorithms

Vorgestellte Ausgabe

ISBN 10:  3642084699 ISBN 13:  9783642084690
Verlag: Springer, 2010
Softcover

Suchergebnisse für Approximation Algorithms

Beispielbild für diese ISBN

Vijay Vazirani
Verlag: Springer-Verlag GmbH, 2002
ISBN 10: 3540653678 ISBN 13: 9783540653677
Gebraucht Hardcover

Anbieter: Buchpark, Trebbin, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: Gut. Zustand: Gut - Gebrauchs- und Lagerspuren. Außen: angestoßen. | Seiten: 380 | Sprache: Englisch | Produktart: Bücher. Artikel-Nr. 872066/3

Verkäufer kontaktieren

Gebraucht kaufen

EUR 20,10
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Vazirani, Vijay V.
Verlag: Springer, 2001
ISBN 10: 3540653678 ISBN 13: 9783540653677
Neu Hardcover

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. In English. Artikel-Nr. ria9783540653677_new

Verkäufer kontaktieren

Neu kaufen

EUR 94,05
Währung umrechnen
Versand: EUR 5,92
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Vijay V. Vazirani
ISBN 10: 3540653678 ISBN 13: 9783540653677
Neu Hardcover

Anbieter: moluna, Greven, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. Spreads powerful algorithmic ideas developed in this area to practitionersWill accelerate progress in this areaRaises algorithmic awareness of the scientific community by showing simple ways of expressing complex algorithmic ideasAn indispensabl. Artikel-Nr. 4897185

Verkäufer kontaktieren

Neu kaufen

EUR 109,85
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Vijay V. Vazirani
ISBN 10: 3540653678 ISBN 13: 9783540653677
Neu Hardcover

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Buch. Zustand: Neu. Neuware - Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed con jecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of ap proximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinato rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly cat egorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them. Artikel-Nr. 9783540653677

Verkäufer kontaktieren

Neu kaufen

EUR 134,39
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb