MARC Record from harvard_bibliographic_metadata

LEADER: 04961nam a22005295a 4500
001 014158538-2
005 20141003190725.0
008 100301s1997 gw | o ||0| 0|eng d
020 $a9783642042959
020 $a9783642042942 (ebk.)
020 $a9783642042959
020 $a9783642042942
024 7 $a10.1007/978-3-642-04295-9$2doi
035 $a(Springer)9783642042959
040 $aSpringer
050 4 $aQA164-167.2
072 7 $aMAT036000$2bisacsh
072 7 $aPBV$2bicssc
082 04 $a511.6$223
100 1 $aDeza, Michel Marie,$eauthor.
245 10 $aGeometry of Cuts and Metrics /$cby Michel Marie Deza, Monique Laurent.
264 1 $aBerlin, Heidelberg :$bSpringer Berlin Heidelberg :$bSpringer,$c1997.
300 $bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aAlgorithms and Combinatorics,$x0937-5511 ;$v15
505 0 $aOutline of the Book -- I.Measure Aspects: El-Embeddability and Probability -- Preliminaries on Distances -- The Cut Cone and ℓ-Metrics -- The Correlation Cone and {0. 1}-Covariances -- Conditions for -Embeddability -- Operations -- -Metrics from Lattices, Semigroups and Normed Spaces -- Metric Transforms of -Spaces -- Lipschitz Embeddings -- Dimensionality Questions for -Embeddings -- Examples of the Use of the -Metric -- Basic Definitions -- I1.Hypermetric Spaces: an Approach via Geometry of Numbers -- Preliminaries on Lattices -- Hypermetrics and Delaunay Polytopes -- Delaunay Polytopes: Rank and Hypermetric Faces -- Extreme Delaunay Polytopes -- Hypermetric Graphs -- I11.Isometric Embeddings of Graphs -- Preliminaries on Graphs -- Isometric Embeddings of Graphs into Hypercubes -- Isometric Embeddings of Graphs into Cartesian Products -- -Graphs -- IV.Hypercube Embeddings and Designs -- Rigidity of the Equidistant Metric -- Hypercube Embeddings of the Equidistant Metric -- Recognition of Hypercube Embeddable Metrics -- Cut Lattices, Quasi -Distances and Hilbert Bases -- V.Facets of the Cut Cone and Polytope -- Operations on Valid Inequalities and Facets -- Triangle Inequalities -- Hypermetric Inequalities -- Clique-Web Inequalities -- Other Valid Inequalities and Facets -- Geometric Properties.
520 $aCuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, distance geometry, combinatorial matrix theory, statistical physics, VLSI design etc. A main feature of this book is its interdisciplinarity. The book contains a wealth of results, from different mathematical disciplines, which are presented here in a unified and comprehensive manner. Geometric representations and methods turn out to be the linking theme. This book will provide a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the interdisciplinarity of these fields as it gathers methods and results from polytope theory, geometry of numbers, probability theory, design and graph theory around two objects, cuts and metrics.
520 $a[… ] The book is very nicely written [… ] The book is also very well structured. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [… ] In my opinion, the book is a beautiful piece of work. The longer one works with it, the more beautiful it becomes." Robert Weismantel, Optima 56 (1997) "… In short, this is a very interesting book which is nice to have." Alexander I. Barvinok, MR 1460488 (98g:52001) "… This is a large and fascinating book. As befits a book which contains material relevant to so many areas of mathematics (and related disciplines such as statistics, physics, computing science, and economics), it is self-contained and written in a readable style.
520 $aMoreover, the index, bibliography, and table of contents are all that they should be in such a work; it is easy to find as much or as little introductory material as needed." R.Dawson, Zentralblatt MATH Database 0885.52001
650 20 $aNumber theory.
650 20 $aCombinatorial analysis.
650 10 $aMathematics.
650 0 $aCombinatorial analysis.
650 0 $aComputer science.
650 0 $aDiscrete groups.
650 0 $aMathematics.
650 0 $aNumber theory.
650 24 $aConvex and Discrete Geometry.
650 24 $aMath Applications in Computer Science.
700 1 $aLaurent, Monique,$eauthor.
776 08 $iPrinted edition:$z9783642042942
830 0 $aAlgorithms and Combinatorics ;$v15.
988 $a20140910
906 $0VEN