MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03954nmm a22003375i 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20230705150648.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
130125s2003 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783662045657 |
| -- |
978-3-662-04565-7 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.0151 |
| Edition number |
23 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Vazirani, Vijay V. |
| 9 (RLIN) |
21057 |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Approximation Algorithms |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc. |
by Vijay V. Vazirani. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
1st ed. 2003. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Berlin, Heidelberg : |
| Name of publisher, distributor, etc. |
Springer Berlin Heidelberg : |
| -- |
Imprint: Springer, |
| Date of publication, distribution, etc. |
2003. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XIX, 380 p. |
| Other physical details |
online resource. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computer science. |
| 9 (RLIN) |
21058 |
|
|---|
| Topical term or geographic name entry element |
Algorithms. |
| 9 (RLIN) |
21059 |
|
|---|
| Topical term or geographic name entry element |
Computer science-Mathematics. |
| 9 (RLIN) |
21060 |
|
|---|
| Topical term or geographic name entry element |
Discrete mathematics. |
| 9 (RLIN) |
21061 |
|
|---|
| Topical term or geographic name entry element |
Operations research. |
| 9 (RLIN) |
21062 |
|
|---|
| Topical term or geographic name entry element |
Numerical analysis. |
| 9 (RLIN) |
21063 |
|
|---|
| Topical term or geographic name entry element |
Theory of Computation. |
| 9 (RLIN) |
21064 |
|
|---|
| Topical term or geographic name entry element |
Algorithms. |
| 9 (RLIN) |
21059 |
|
|---|
| Topical term or geographic name entry element |
Discrete Mathematics in Computer Science. |
| 9 (RLIN) |
21065 |
|
|---|
| Topical term or geographic name entry element |
Operations Research and Decision Theory. |
| 9 (RLIN) |
21066 |
|
|---|
| Topical term or geographic name entry element |
Discrete Mathematics. |
| 9 (RLIN) |
21067 |
|
|---|
| Topical term or geographic name entry element |
Numerical Analysis. |
| 9 (RLIN) |
21068 |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="https://doi.org/10.1007/978-3-662-04565-7">https://doi.org/10.1007/978-3-662-04565-7</a> |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
e-Book |
