Pages that link to "Item:Q2434729"

The following pages link to Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729):

Displaying 2 items.

• Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems (Q5136261) (← links)
• The Maximum Flow Problem for Oriented Flows (Q5240225) (← links)