Bild 1 von 1
BEENDET
ANNÄHERUNGSALG
Excellent Condition! Quick & Free Delivery in 2-14 days
Artikelzustand:
“Book is in Very Good Condition. Text will be unmarked. May show some signs of use or wear. Will ”... Mehr erfahrenÜber den Artikelzustand
Preis:
US $46,49
Ca.CHF 41,40
Versand:
Standort: US, USA
Lieferung:
Lieferung zwischen Fr, 21. Jun und Mo, 24. Jun nach 43230 bei heutigem Zahlungseingang
Rücknahmen:
Zahlungen:
Sicher einkaufen
Angaben zum Verkäufer
Angemeldet als gewerblicher Verkäufer
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:335360235097
Artikelmerkmale
- Artikelzustand
- Sehr gut
- Hinweise des Verkäufers
- ISBN-10
- 3540653678
- Book Title
- Approximation Algorithms
- Genre
- Computer science
- Item Height
- 6.14 inches
- ISBN
- 9783540653677
- Subject Area
- Computers, Mathematics
- Publication Name
- Approximation Algorithms
- Item Length
- 9.3 in
- Publisher
- Springer Berlin / Heidelberg
- Subject
- Programming / Algorithms, Functional Analysis, Computer Science, Discrete Mathematics
- Publication Year
- 2001
- Type
- Textbook
- Format
- Hardcover
- Language
- English
- Item Width
- 6.1 in
- Item Weight
- 57.8 Oz
- Number of Pages
- Xix, 380 Pages
Über dieses Produkt
Product Information
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.
Product Identifiers
Publisher
Springer Berlin / Heidelberg
ISBN-10
3540653678
ISBN-13
9783540653677
eBay Product ID (ePID)
777302
Product Key Features
Publication Name
Approximation Algorithms
Format
Hardcover
Language
English
Subject
Programming / Algorithms, Functional Analysis, Computer Science, Discrete Mathematics
Publication Year
2001
Type
Textbook
Subject Area
Computers, Mathematics
Number of Pages
Xix, 380 Pages
Dimensions
Item Length
9.3 in
Item Width
6.1 in
Item Weight
57.8 Oz
Additional Product Features
LCCN
2001-042005
Intended Audience
Scholarly & Professional
Number of Volumes
1 Vol.
Lc Classification Number
Qa75.5-76.95
Reviews
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), 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 ... ." (Csand Imreh, Acta Scientiarum Mathematicarum, Vol. 68, 2002), 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), 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 asection 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)
Table of Content
1 Introduction.- I. Combinatorial Algorithms.- 2 Set Cover.- 3 Steiner Tree and TSP.- 4 Multiway Cut and k-Cut.- 5 k-Center.- 6 Feedback Vertex Set.- 7 Shortest Superstring.- 8 Knapsack.- 9 Bin Packing.- 10 Minimum Makespan Scheduling.- 11 Euclidean TSP.- II. LP-Based Algorithms.- 12 Introduction to LP-Duality.- 13 Set Cover via Dual Fitting.- 14 Rounding Applied to Set Cover.- 15 Set Cover via the Primal--Dual Schema.- 16 Maximum Satisfiability.- 17 Scheduling on Unrelated Parallel Machines.- 18 Multicut and Integer Multicommodity Flow in Trees.- 19 Multiway Cut.- 20 Multicut in General Graphs.- 21 Sparsest Cut.- 22 Steiner Forest.- 23 Steiner Network.- 24 Facility Location.- 25 k-Median.- 26 Semidefinite Programming.- III. Other Topics.- 27 Shortest Vector.- 28 Counting Problems.- 29 Hardness of Approximation.- 30 Open Problems.- A An Overview of Complexity Theory for the Algorithm Designer.- A.3.1 Approximation factor preserving reductions.- A.4 Randomized complexity classes.- A.5 Self-reducibility.- A.6 Notes.- B Basic Facts from Probability Theory.- B.1 Expectation and moments.- B.2 Deviations from the mean.- B.3 Basic distributions.- B.4 Notes.- References.- Problem Index.
Copyright Date
2003
Dewey Decimal
005.1
Dewey Edition
22
Illustrated
Yes
Artikelbeschreibung des Verkäufers
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:335360235097
Verpackung und Versand
Artikelstandort:
US, USA
Versand nach:
Afghanistan, Albanien, Algerien, Andorra, Angola, Anguilla, Antigua und Barbuda, Argentinien, Armenien, Aruba, Aserbaidschan, Australien, Bahamas, Bahrain, Bangladesch, Belgien, Belize, Benin, Bermuda, Bhutan, Bolivien, Bosnien und Herzegowina, Botsuana, Brasilien, Brunei Darussalam, Bulgarien, Burkina Faso, Burundi, Chile, China, Costa Rica, Côte d'Ivoire (Elfenbeinküste), Demokratische Republik Kongo, Deutschland, Dominikanische Republik, Dschibuti, Dänemark, Ecuador, El Salvador, Eritrea, Estland, Fidschi, Finnland, Frankreich, Gabun, Gambia, Georgien, Ghana, Gibraltar, Grenada, Griechenland, Grönland, Guatemala, Guinea, Guinea-Bissau, Guyana, Haiti, Honduras, Hongkong, Indien, Indonesien, Irland, Island, Israel, Italien, Jamaika, Japan, Jemen, Jordanien, Kaimaninseln, Kambodscha, Kamerun, Kanada, Kapverdische Inseln, Kasachstan, Katar, Kenia, Kirgisistan, Kiribati, Kolumbien, Kuwait, Laos, Lesotho, Lettland, Libanon, Liberia, Liechtenstein, Litauen, Luxemburg, Macau, Madagaskar, Malawi, Malaysia, Malediven, Mali, Malta, Marokko, Mauretanien, Mauritius, Mazedonien, Mexiko, Moldawien, Monaco, Mongolei, Montenegro, Montserrat, Mosambik, Namibia, Nauru, Nepal, Neuseeland, Nicaragua, Niederlande, Niger, Nigeria, Norwegen, Oman, Pakistan, Panama, Papua-Neuguinea, Paraguay, Peru, Philippinen, Polen, Portugal, Republik Kongo, Republik Kroatien, Ruanda, Rumänien, Salomonen, Sambia, Samoa (Westsamoa), San Marino, Saudi-Arabien, Schweden, Schweiz, Senegal, Serbien, Seychellen, Sierra Leone, Simbabwe, Singapur, Slowakei, Slowenien, Spanien, Sri Lanka, St. Kitts und Nevis, St. Lucia, St. Vincent und die Grenadinen, Suriname, Swasiland, Südafrika, Südkorea, Tadschikistan, Taiwan, Tansania, Thailand, Togo, Tonga, Trinidad und Tobago, Tschad, Tschechische Republik, Tunesien, Turkmenistan, Turks- und Caicosinseln, Türkei, USA, Uganda, Ungarn, Uruguay, Usbekistan, Vanuatu, Vatikan, Vereinigte Arabische Emirate, Vereinigtes Königreich, Vietnam, Wallis und Futuna, Zentralafrikanische Republik, Zypern, Ägypten, Äquatorialguinea, Äthiopien, Österreich
Ausgeschlossen:
APO/FPO, Amerikanisch-Samoa, Barbados, Belarus, Britische Jungferninseln, Cookinseln, Dominica, Falklandinseln (Malwinen), Französisch-Guayana, Französisch-Polynesien, Guadeloupe, Guam, Guernsey, Irak, Jersey, Jungferninseln (USA), Komoren, Libyen, Marshallinseln, Martinique, Mayotte, Mikronesien, Neukaledonien, Niederländische Antillen, Niue, Palau, Puerto Rico, Russische Föderation, Réunion, Saint-Pierre und Miquelon, Somalia, St. Helena, Svalbard und Jan Mayen, Tuvalu, US-Protektorate, Ukraine, Venezuela, Westsahara
| Verpackung und Versand | Nach | Service | Lieferung*Siehe Lieferhinweise |
|---|---|---|---|
| Kostenloser Versand | USA | Standardversand (USPS Ground Advantage®) | Lieferung zwischen Fr, 21. Jun und Mo, 24. Jun nach 43230 |
| Bearbeitungszeit |
|---|
| Der Verkäufer verschickt den Artikel innerhalb von 3 Werktagen nach Zahlungseingang. |
| Steuern |
|---|
| Verkäufer berechnet Steuern in |
Mehrwertsteuer für diesen Artikel #335360235097
Mehrwertsteuer für diesen Artikel #335360235097
Der Verkäufer berechnet Mehrwertsteuer für Artikel, die in die folgenden Bundesstaaten verschickt werden:
| Bundesstaat | Steuersatz für Sales Tax |
|---|
Rücknahmebedingungen
| Frist für Kontaktaufnahme mit dem Verkäufer nach Erhalt Artikels: | Rückerstattung erfolgt in folgender Form: | Rücksendung |
|---|---|---|
| 30 Tage | Geld zurück | Verkäufer zahlt Rückversand |
Der Verkäufer trägt die Rücksendekosten.
| Rücknahmebedingungen im Detail |
|---|
| Rücknahme akzeptiert |
Zahlungsdaten
Zahlungsmethoden
Beliebte Kategorien in diesem Shop
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (264'914)
p***j (62)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
Fast shipping and exactly as described! Wonderful experience!
d***2 (1748)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
Thank you.
5***i (724)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
Great seller, fast shipping. Thanks!