Multicommodity Flow in Polynomial Time

Details Multicommodity Flow in Polynomial Time Multicommodity Flow in Polynomial Time

2009-06-28

arxiv.org/abs/0906.5106v2

Optimization Letters, 5:13--25, 2011

Mathematics

Combinatorics

Scientific paper

The multicommodity flow problem is NP-hard already for two commodities over
bipartite graphs. Nonetheless, using our recent theory of n-fold integer
programming and extensions developed herein, we are able to establish the
surprising polynomial time solvability of the problem in two broad situations.

Affiliated with

Also associated with

No associations

Rating

Multicommodity Flow in Polynomial Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multicommodity Flow in Polynomial Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multicommodity Flow in Polynomial Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-246972