An algorithmic theory of numbers, graphs, and convexity

摘要: How to Round Numbers Preliminaries: On Algorithms Involving Diophantine Approximation, Problems Lattices, Bases, and the Reduction Problem Approximation Rounding What is a Real Number Convex Body Inputting Set Algorithmic on Sets The Ellipsoid Method Rational Polyhedra Some Other Integer Programming in Fixed Dimension Applications Combinatorics Cuts Joins Chromatic Number, Cliques Perfect Graphs Minimizing Submodular Function.