An Algorithmic Theory of Numbers, Graphs and Convexity - Brossura

Lovasz, Laszlo

Brossura

ISBN 10: 0898712033 ISBN 13: 9780898712032

Casa editrice: Society for Industrial and Applied Mathematics, 1987

Riassunto

Studies two algorithms in detail: the ellipsoid method and the simultaneous diophantine approximation method.

Su questo libro

Descrizione del libro

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.

Contenuti

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.

Dettagli dell?edizione

• Editore: Society for Industrial and Applied Mathematics
• Data di pubblicazione: 1987
• Lingua: Inglese
• ISBN 10: 0898712033
• ISBN 13: 9780898712032
• Rilegatura: Copertina flessibile
• Numero di pagine: 97
• Contatto del produttore: non disponibile