Pages that link to "Item:Q4019972"
From MaRDI portal
The following pages link to Approximation Algorithms for the Maximum Concurrent Flow Problem (Q4019972):
Displaying 14 items.
- A combinatorial approximation algorithm for concurrent flow problem and its application (Q707017) (← links)
- Maximum concurrent flow with incomplete data (Q1661862) (← links)
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem (Q1849528) (← links)
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads (Q2075458) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- Using the minimum maximum flow degree to approximate the flow coloring problem (Q2675725) (← links)
- Combinatorial approximation algorithms for generalized flow problems (Q2709797) (← links)
- A maximum multicommodity flow problem with global fair met rate (Q2885689) (← links)
- The maximum concurrent flow problem (Q3474283) (← links)
- Capacitated Confluent Flows: Complexity and Algorithms (Q3563015) (← links)
- (Q4228485) (← links)
- On Canonical Concurrent Flows, Crossing Number and Graph Expansion (Q4325335) (← links)
- Efficient algorithms for the maximum concurrent flow problem (Q4642463) (← links)
- An exponential‐function reduction method for block‐angular convex programs (Q4894869) (← links)