You are here

An Algorithmic Theory of Numbers, Graphs, and Convexity

Publisher: 
SIAM
Number of Pages: 
91
Price: 
33.50
ISBN: 
0-89871-203-3
Date Received: 
Saturday, July 22, 2006
Reviewable: 
No
Include In BLL Rating: 
Yes
Reviewer Email Address: 
László Lovász
Series: 
C B M S - N S F Regional Conference Series in Applied Mathematics 50
Publication Date: 
1986
Format: 
Paperback
Category: 
Textbook

 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.

Publish Book: 
Modify Date: 
Saturday, July 22, 2006

Dummy View - NOT TO BE DELETED