Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Flow Network Capacity Augmentation

  1. Mar 7, 2009 #1
    Suppose that you have a http://en.wikipedia.org/wiki/Flow_network" [Broken] with integer edge capacities, and n dollars. You may spend one dollar to increase the capacity of an existing edge by one. The question is, how can you spend your dollars so that the maximum flow through the resulting network is maximized?
     
    Last edited by a moderator: May 4, 2017
  2. jcsd
  3. Mar 8, 2009 #2
    The max-flow min-cut theorem might be a good place to start in constructing a spending strategy.
     
    Last edited by a moderator: May 4, 2017
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Flow Network Capacity Augmentation
  1. Tank capacity (Replies: 1)

  2. Basic network question (Replies: 4)

Loading...