EUR 16,48
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
EUR 16,48
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: good. Signs of wear and consistent use.
EUR 20,01
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.
EUR 23,30
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: Good. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
EUR 64,88
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
EUR 75,48
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 71,68
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
EUR 71,68
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
EUR 83,27
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
EUR 98,18
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. New Copy. Customer Service Guaranteed.
EUR 90,80
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In English.
EUR 90,79
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001
ISBN 10: 3540653678 ISBN 13: 9783540653677
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 117,29
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 1st ed. 2001. Corr. 2nd printing 2002. This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms.Richard Karp,University Professor, University of California at BerkeleyFollowing the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer.It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic.I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms.Laszlo Lovasz, Senior Researcher, Microsoft Research.
Idioma: Inglés
Publicado por Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001
ISBN 10: 3540653678 ISBN 13: 9783540653677
Librería: Rarewaves.com UK, London, Reino Unido
EUR 110,82
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 1st ed. 2001. Corr. 2nd printing 2002. This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms.Richard Karp,University Professor, University of California at BerkeleyFollowing the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer.It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic.I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms.Laszlo Lovasz, Senior Researcher, Microsoft Research.
EUR 171,13
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 161,63
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
EUR 193,85
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2001
ISBN 10: 3540653678 ISBN 13: 9783540653677
Librería: moluna, Greven, Alemania
EUR 84,15
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.