Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Network Flow Algorithms - David P. Williamson

Anglų
2019-09-30
80,57 € 107,43 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 15-21 d.d.

30 dienų grąžinimo politika

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 refere ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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.

Daugiau informacijos

Autorius David P. Williamson
Leidėjas Cambridge University Press
Išleidimo metai 2019
Viršelio tipas Minkšti viršeliai
EAN 9781316636831
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Network Flow Algorithms
Jūsų įvertinimas:

Goodreads Atsiliepimai

80,57 € 107,43 €