- Добавил: literator
- Дата: 31-07-2020, 14:36
- Комментариев: 0

Автор: Smartest Library
Издательство: Smartest Library
Год: 2020
Страниц: 393
Язык: английский
Формат: pdf, epub
Размер: 10.1 MB
This lecture note discusses the approaches to designing optimization algorithms, including dynamic programming and greedy algorithms, graph algorithms, minimum spanning trees, shortest paths, and network flows. Also it briefly discusses algorithmic problems arising from geometric settings, that is, computational geometry. What is an algorithm? Our text defines an algorithm to be any well-defined computational procedure that takes some values as input and produces some values as output. Like a cooking recipe, an algorithm provides a step-by-step method for solving a computational problem. Unlike programs, algorithms are not dependent on a particular programming language, machine, system, or compiler.