Articoli correlati a Approximation Algorithms
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dalla quarta di copertina
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 Berkeley
Following 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.
László Lovász, Senior Researcher, Microsoft Research
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2010
- ISBN 10 3642084699
- ISBN 13 9783642084690
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine404
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 57,59
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Approximation Algorithms
Foto dell'editore
Approximation Algorithms
Editore:
Springer Berlin / Heidelberg, 2010
ISBN 10: 3642084699
ISBN 13: 9783642084690
Antico o usato
Brossura
Da: Better World Books: West, Reno, NV, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects. Codice articolo 17287813-6
Quantità: 2 disponibili
Immagini fornite dal venditore
Approximation Algorithms
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 5047509
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Approximation Algorithms
Editore:
Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642084699
ISBN 13: 9783642084690
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 404 pp. Englisch. Codice articolo 9783642084690
Quantità: 2 disponibili
Foto dell'editore
Approximation Algorithms
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783642084690_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Approximation Algorithms
Editore:
Springer Berlin Heidelberg, Springer Berlin Heidelberg, 2010
ISBN 10: 3642084699
ISBN 13: 9783642084690
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783642084690
Quantità: 1 disponibili
Immagini fornite dal venditore
Approximation Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 12033830
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Approximation Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 12033830-n
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Approximation Algorithms
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 12033830-n
Quantità: Più di 20 disponibili
Foto dell'editore
Approximation Algorithms
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9783642084690
Quantità: 10 disponibili
Foto dell'editore
Approximation Algorithms
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 402. Codice articolo 262451029
Quantità: 4 disponibili