An Algorithmic Theory of Numbers, Graphs and Convexity
Seiten
1987
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-0-89871-203-2 (ISBN)
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-0-89871-203-2 (ISBN)
- Titel z.Zt. nicht lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
Describes use of the simultaneous diophantine method to develop sophisticated rounding procedures. Then a model is described to compute upper and lower bounds on various measures of convex bodies. Use of the two algorithms is brought together by the author in a study of polyhedra with rational vertices.
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. Two algorithms are studied in detail: the ellipsoid method and the simultaneous diophantine approximation method. Although both were developed to study, on a theoretical level, the feasibility of computing some specialized problems in polynomial time, they appear to have practical applications. The book first describes use of the simultaneous diophantine method to develop sophisticated rounding procedures. Then a model is described to compute upper and lower bounds on various measures of convex bodies. Use of the two algorithms is brought together by the author in a study of polyhedra with rational vertices. The book closes with some applications of the results to combinatorial optimization.
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. Two algorithms are studied in detail: the ellipsoid method and the simultaneous diophantine approximation method. Although both were developed to study, on a theoretical level, the feasibility of computing some specialized problems in polynomial time, they appear to have practical applications. The book first describes use of the simultaneous diophantine method to develop sophisticated rounding procedures. Then a model is described to compute upper and lower bounds on various measures of convex bodies. Use of the two algorithms is brought together by the author in a study of polyhedra with rational vertices. The book closes with some applications of the results to combinatorial optimization.
How to Round Numbers; Preliminaries: On Algorithms Involving Numbers; Diophantine Approximation, Problems; Lattices, Bases, and the Reduction Problem; Diophantine Approximation and Rounding; What is a Real Number How to Round a Convex Body; Preliminaries: Inputting a Set; Algorithmic Problems on Convex Sets; The Ellipsoid Method; Rational Polyhedra; Some Other Algorithmic Problems on Convex Sets; Integer Programming in Fixed Dimension; Some Applications in Combinatorics; Cuts and Joins; Chromatic Number, Cliques and Perfect Graphs; Minimizing a Submodular Function.
| Erscheint lt. Verlag | 1.1.1987 |
|---|---|
| Reihe/Serie | CBMS-NSF Regional Conference Series in Applied Mathematics |
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | New York |
| Sprache | englisch |
| Maße | 172 x 253 mm |
| Gewicht | 188 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 0-89871-203-3 / 0898712033 |
| ISBN-13 | 978-0-89871-203-2 / 9780898712032 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Sieben ausgewählte Themenstellungen
Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
CHF 89,95
unlock your imagination with the narrative of numbers
Buch | Softcover (2024)
Advantage Media Group (Verlag)
CHF 27,90
