A node-capacitated Okamura–Seymour theorem

Keyphrases

• Capacitated 100%
• Cutting Conditions 50%
• Polymatroid 50%
• Concurrent Flow 25%
• Planar Graph 25%
• Multi-commodity 25%
• Convex Programming 25%
• Submodular Function 25%
• Multicommodity Flow 25%
• Node Cut 25%
• Combinatorial Structure 25%
• Metric Embedding 25%
• Random Metric Space 25%
• Underlying Graph 25%

Mathematics

• Edge 100%
• Combinatorial Structure 50%
• Approximates 50%
• Convex Programming 50%
• Cut Node 50%
• Planar Graph 50%