Multicommodity flows and cuts in polymatroidal networks

Keyphrases

• Multicommodity Flow 100%
• Polymatroidal Networks 100%
• Wireless Networks 33%
• Submodular Function 33%
• Capacitated 33%
• Undirected Graph 16%
• Information Flow 16%
• Directed Graph 16%
• Capacity Constraints 16%
• Discrete Mathematics 16%
• Flow Model 16%
• Lower Average 16%
• Multi-commodity Flow Problem 16%
• Natural Places 16%
• Average Distortion 16%
• Cutting Problem 16%
• Min-cut 16%
• Maximum Flow 16%
• Israel 16%
• Single Commodity 16%
• Opers 16%
• Network Flow Model 16%
• Undirected Network 16%
• Gap Result 16%
• Network Flow 16%
• Continuous Extension 16%
• New Haven 16%
• Multi-commodity 16%
• Yale University 16%
• Line Embedding 16%
• Network Information Flow 16%
• Submodular Flows 16%
• Submodular Capacity 16%
• Function Embedding 16%
• Flow-cut Gap 16%

Computer Science

• Wireless Networks 100%
• Directed Graphs 100%
• Capacity Constraint 50%
• Flow Model 50%
• Undirected Network 50%
• Network Flow Model 50%
• Maxflow 50%

Mathematics

• Lovsz Extension 100%