Multicommodity Flow in Polynomial Time

Published 28 Jun 2009 in math.CO, cs.DM, cs.DS, and math.OC | (0906.5106v2)

Abstract: 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.

Abstract PDF Upgrade to Chat

Citations (1)

View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.