Network Flow Algorithms

Network Flow Algorithms

book type
0 Відгук(ів) 
LF/200595/R
Английский
В наличии
157,50 грн
141,75 грн Сохранить 10%
  Моментальное скачивание 

после оплаты (24/7)

  Широкий выбор форматов 

(для всех устройств)

  Полная версия книги 

(в т.ч. для Apple и Android)

Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.
LF/200595/R

Характеристики

ФИО Автора
David P.
Williamson
Язык
Английский
ISBN
9781316952894
Дата выхода
2019

Отзывы

Напишите свой отзыв

Network Flow Algorithms

Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model no...

Напишите свой отзыв

15 книг этого же автора

Товары из этой категории: