Avancerad sökning
1 artiklar, totalt 199 kr
Ändra i din kundvagn Gå till kassan
Network Flow Algorithms
  • Bandtyp: Inbunden
  • Språk: Engelska
  • Utgiven: 201909
  • Antal sidor: 326
  • Vikt i gram: 580
  • ISBN10:1107185890
  • ISBN13:9781107185890

Network Flow Algorithms

(Inbunden)
Beskrivning:

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.

Kundrecensioner och bloggar

Sök fler böcker:

Kunder som köpt denna bok har
även köpt:
Lägg i kundvagn Pris199 kr
Uppgång och fall
av Strömquist, Liv
Lägg i kundvagn Pris199 kr
Den allvarsamma leken
av Söderberg, Hjalmar
Pris53 kr
Miniatyrmakaren
av Burton, Jessie
Pris54 kr
Min mors självbiografi
av Kincaid, Jamaica
Lägg i kundvagn Pris208 kr