An algorithmic theory of numbers, graphs, and convexity
Читати фрагмент
Моментальне завантаження
після оплати (24/7)
Широкий вибір форматів
(для всіх пристроїв)
Повна версія книги
(в т.ч. для Apple та Android)
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.
LF/222445237/R
Характеристики
- ФІО Автора
- László Lovász
- Мова
- Англійська
- Серія
- CBMS-NSF regional conference series in applied mathematics 50
- ISBN
- 9780898712032
- Дата виходу
- 1986
15 книг цього ж автора
Товари з цієї категорії:
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic des...