Geometry of Cuts and Metrics

Author: Michel Marie Deza,Monique Laurent

Publisher: Springer

ISBN: 3642042953

Category: Mathematics

Page: 588

View: 7056

Cuts 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, combinatorial matrix theory, statistical physics, VLSI design etc. This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides 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 [...]. 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. [...] The longer one works with it, the more beautiful it becomes." Optima 56, 1997.

Discrete and Computational Geometry

Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers

Author: Jin Akiyama,Mikio Kano,Masatsugu Urabe

Publisher: Springer

ISBN: 3540477381

Category: Computers

Page: 388

View: 3858

This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2001, held in Tokyo, Japan in November 2001. The 35 revised papers presented were carefully reviewed and selected. Among the topics covered are polygons and polyhedrons, divissible dissections, convex polygon packings, symmetric subsets, convex decompositions, graph drawing, graph computations, point sets, approximation, Delauny diagrams, triangulations, chromatic numbers, complexity, layer routing, efficient algorithms, and illumination problems.

Semidefinite Optimization and Convex Algebraic Geometry

Author: Grigoriy Blekherman,Pablo A. Parrilo,Rekha R. Thomas

Publisher: SIAM

ISBN: 1611972280

Category: Mathematics

Page: 476

View: 5445

An accessible introduction to convex algebraic geometry and semidefinite optimization. For graduate students and researchers in mathematics and computer science.

Discrete and Computational Geometry

Japanese Conference, JCDCG ..., Revised Papers

Author: N.A

Publisher: N.A

ISBN: N.A

Category: Combinatorial geometry

Page: N.A

View: 9663

Kombinatorische Optimierung

Theorie und Algorithmen

Author: Bernhard Korte,Jens Vygen

Publisher: Springer-Verlag

ISBN: 3540769196

Category: Mathematics

Page: 675

View: 5985

Das Lehrbuch ist die deutsche Übersetzung der 4., wesentlich erweiterten Auflage des Titels „Combinatorial Optimization – Theory and Algorithms". Es gibt den neuesten Stand der kombinatorischen Optimierung wieder und liefert vornehmlich theoretische Resultate und Algorithmen mit beweisbar guten Laufzeiten und Ergebnissen, jedoch keine Heuristiken. Enthalten sind vollständige Beweise, auch für viele tiefe und neue Resultate, von denen einige bisher in der Lehrbuchliteratur noch nicht erschienen sind. Mit Übungen und umfassendem Literaturverzeichnis.

Surveys in Combinatorics

Invited Papers for the ... British Combinatorial Conference

Author: Bridget S. Webb

Publisher: N.A

ISBN: N.A

Category: Combinatorial analysis

Page: N.A

View: 9094

Applications of stress theory

realizing graphs and kneser-poulsen

Author: Teresa Maria Belk

Publisher: N.A

ISBN: N.A

Category:

Page: 166

View: 4003

Algorithms in Combinatorial Geometry

Author: Herbert Edelsbrunner

Publisher: Springer Science & Business Media

ISBN: 9783540137221

Category: Computers

Page: 423

View: 9652

Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.

Besser als Mathe

Moderne angewandte Mathematik aus dem MATHEON zum Mitmachen

Author: Katja Biermann,Martin Grötschel,Brigitte Lutz-Westphal

Publisher: Springer-Verlag

ISBN: 3834893803

Category: Mathematics

Page: 265

View: 6730

"Wozu braucht man Mathematik?" Dieses Buch stellt unter Beweis, dass moderne Mathematik in fast sämtlichen Lebensbereichen eine wichtige Rolle spielt. Aktuelle Forschung wird durch unterhaltsame Aufgaben und ihre Lösungen anschaulich.Das Buch fordert zum aktiven Mitmachen auf und zeigt Schülerinnen und Schülern, dass Mathematik interessant ist und Freude bereiten kann. Für die Anstrengung des konzentrierten Nachdenkens werden die Leserinnen und Leser mit nützlichen und manchmal auch verblüffenden Ergebnissen belohnt. Das Buch basiert auf einer Auswahl der schönsten Aufgaben aus sechs Jahrgängen des mathematischen Adventskalenders des DFG-Forschungszentrums MATHEON (www.mathekalender.de). Freuen Sie sich auf eine Rundreise durch spannende Mathematik und ihre Anwendungen!

Ars Combinatoria

Author: N.A

Publisher: N.A

ISBN: N.A

Category: Combinatorial analysis

Page: N.A

View: 5614

DEXA 99

Author: Antonio Cammelli,A Min Tjoa,Roland R. Wagner

Publisher: IEEE

ISBN: 9780769502816

Category: Computers

Page: 937

View: 2682

Proceedings of the September 1999 workshop on defining requirements for future systems in the areas of database and artificial technologies. The 151 contributions discuss innovative applications and new architectures; mobility in databases and distributed systems; similarity search; web-based inform"

Approximative Algorithmen und Nichtapproximierbarkeit

Author: Klaus Jansen,Marian Margraf

Publisher: Walter de Gruyter

ISBN: 3110203170

Category: Mathematics

Page: 501

View: 6121

Gegenstand dieses Lehrbuchs ist die Behandlung schwer lösbarer diskreter Optimierungsprobleme. Im ersten Teil werden schnelle Algorithmen vorgestellt, die solche Probleme näherungsweise lösen können. Der zweite Teil behandelt Komplexitätstheorie und Nichtapproximierbarkeit von Optimierungsproblemen. Das Lehrbuch enthält zudem zahlreiche Anwendungsbeispiele, Übungsaufgaben, Illustrationen und Abschnitte über Grundlagen wie etwa die Turingmaschine.

Theorie der Gleichverteilung

Author: Edmund Hlawka

Publisher: N.A

ISBN: N.A

Category: Distribution, Uniform (Probability theory)

Page: 142

View: 6473

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings

Author: Chandra Chekuri,Klaus Jansen,José D.P. Rolim,Luca Trevisan

Publisher: Springer Science & Business Media

ISBN: 3540282394

Category: Computers

Page: 493

View: 9611

This book constitutes the joint refereed proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and the 9th International Workshop on Randomization and Computation, RANDOM 2005, held in Berkeley, CA, USA in August 2005. The volume contains 41 carefully reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of approximation and randomness.

Handbook of Discrete and Computational Geometry, Second Edition

Author: Csaba D. Toth,Joseph O'Rourke,Jacob E. Goodman

Publisher: CRC Press

ISBN: 9781420035315

Category: Mathematics

Page: 1560

View: 9643

While high-quality books and journals in this field continue to proliferate, none has yet come close to matching the Handbook of Discrete and Computational Geometry, which in its first edition, quickly became the definitive reference work in its field. But with the rapid growth of the discipline and the many advances made over the past seven years, it's time to bring this standard-setting reference up to date. Editors Jacob E. Goodman and Joseph O'Rourke reassembled their stellar panel of contributors, added manymore, and together thoroughly revised their work to make the most important results and methods, both classic and cutting-edge, accessible in one convenient volume. Now over more then 1500 pages, the Handbook of Discrete and Computational Geometry, Second Edition once again provides unparalleled, authoritative coverage of theory, methods, and applications. Highlights of the Second Edition: Thirteen new chapters: Five on applications and others on collision detection, nearest neighbors in high-dimensional spaces, curve and surface reconstruction, embeddings of finite metric spaces, polygonal linkages, the discrepancy method, and geometric graph theory Thorough revisions of all remaining chapters Extended coverage of computational geometry software, now comprising two chapters: one on the LEDA and CGAL libraries, the other on additional software Two indices: An Index of Defined Terms and an Index of Cited Authors Greatly expanded bibliographies

Approximation Algorithms for Combinatorial Optimization

5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings

Author: Klaus Jansen,Stefano Leonardi

Publisher: Springer Science & Business Media

ISBN: 3540441867

Category: Business & Economics

Page: 269

View: 1380

This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002. The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and other fields.