9783540653677 - approximation algorithms von vazirani, vijay v. (19 Ergebnisse)
- Hardcover
Anbieter: World of Books (was SecondSale), Montgomery, IL, USAWorld of Books (was SecondSale)
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Befriedigend
EUR 15,01
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
- Hardcover
Anbieter: HPB-Red, Dallas, TX, USAHPB-Red
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Befriedigend
EUR 14,63
EUR 3,24 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Hardcover. Zustand: 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.
- Hardcover
Anbieter: ThriftBooks-Dallas, Dallas, TX, USAThriftBooks-Dallas
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Ausreichend
EUR 18,54
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Hardcover. Zustand: Fair. No Jacket. Former library book; Missing dust jacket; Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.
- Hardcover
Anbieter: GoldBooks, Denver, CO, USAGoldBooks
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 41,61
EUR 4,75 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Hardcover. Zustand: new. New Copy. Customer Service Guaranteed.
- Hardcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 76,05
EUR 2,28 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
- Hardcover
Anbieter: BennettBooksLtd, Los Angeles, CA, USABennettBooksLtd
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 72,23
EUR 6,00 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
hardcover. Zustand: New. In shrink wrap. Looks like an interesting title.
- Hardcover
Anbieter: BennettBooksLtd, Los Angeles, CA, USABennettBooksLtd
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 72,23
EUR 6,00 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
hardcover. Zustand: New. In shrink wrap. Looks like an interesting title.
Sprache: Englisch
Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2001
- Hardcover
- Erstausgabe
Anbieter: Grand Eagle Retail, Bensenville, IL, USAGrand Eagle Retail
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 100,84
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Hardcover. Zustand: new. Hardcover. 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 Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 91,96
EUR 14,00 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In English.
- Hardcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 91,94
EUR 17,53 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
- Hardcover
Anbieter: California Books, Miami, FL, USACalifornia Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 112,94
Versand gratisVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
Sprache: Englisch
Verlag: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001
- Hardcover
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes KönigreichRarewaves.com USA
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 119,44
Versand gratisVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Hardback. Zustand: New. 1st ed. 2001. Corr. 2nd printing 2002. Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P?NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of thes…e problems, via polynomial-time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms.This book is divided into three parts. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Part II presents linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primal-dual schema. Part III covers four important topics: the first is the problem of finding a shortest vector in a lattice; the second is the approximability of counting, as opposed to optimization, problems; the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; and the fourth topic consists of the numerous open problems of this young field.This book is suitable for use in advanced undergraduate and graduate-level courses on approximation algorithms. An undergraduate course in algorithms and the theory of NP-completeness should suffice as a prerequisite for most of the chapters. This book can also be used as supplementary text in basic undergraduate and graduate algorithms courses.
Sprache: Englisch
Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2001
- Hardcover
- Erstausgabe
Anbieter: AussieBookSeller, Truganina, VIC, AustralienAussieBookSeller
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 157,07
EUR 31,95 VersandVersand von Australien nach USAAnzahl: 1 verfügbar
Hardcover. Zustand: new. Hardcover. 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 Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Sprache: Englisch
Verlag: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001
- Hardcover
Anbieter: Rarewaves.com UK, London, Vereinigtes KönigreichRarewaves.com UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 116,34
EUR 75,96 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Hardback. Zustand: New. 1st ed. 2001. Corr. 2nd printing 2002. Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P?NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of thes…e problems, via polynomial-time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms.This book is divided into three parts. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Part II presents linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primal-dual schema. Part III covers four important topics: the first is the problem of finding a shortest vector in a lattice; the second is the approximability of counting, as opposed to optimization, problems; the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; and the fourth topic consists of the numerous open problems of this young field.This book is suitable for use in advanced undergraduate and graduate-level courses on approximation algorithms. An undergraduate course in algorithms and the theory of NP-completeness should suffice as a prerequisite for most of the chapters. This book can also be used as supplementary text in basic undergraduate and graduate algorithms courses.
- Hardcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 178,13
EUR 17,53 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.
- Hardcover
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes KönigreichMispah books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht - Wie neu
EUR 168,51
EUR 29,21 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Hardcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 201,31
EUR 2,28 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.
- Hardcover
- Print-on-Demand
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 90,26
EUR 14,61 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardcover. Zustand: Brand New. 378 pages. German language. 9.25x6.50x1.00 inches. In Stock. This item is printed on demand.
- Hardcover
- Print-on-Demand
Anbieter: moluna, Greven, Deutschlandmoluna
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 84,15
EUR 48,99 VersandVersand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
Gebunden. Zustand: 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 comp…lex algorithmic ideasAn indispensabl.
