Pages that link to "Item:Q2709797"
From MaRDI portal
The following pages link to Combinatorial approximation algorithms for generalized flow problems (Q2709797):
Displaying 21 items.
- Optimal radio resources and transmission formats assignment in OFDMA systems (Q336504) (← links)
- Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- A combinatorial approximation algorithm for concurrent flow problem and its application (Q707017) (← links)
- Combinatorial approaches to multiflow problems (Q1080357) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Generalized max flow in series-parallel graphs (Q2445843) (← links)
- Combinatorial algorithms for the unsplittable flow problem (Q2492628) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- Faster algorithms for the generalized network flow problem (Q2757524) (← links)
- A polynomial combinatorial algorithm for generalized minimum cost flow (Q2819530) (← links)
- Combinatorial Algorithms for the Generalized Circulation Problem (Q3362078) (← links)
- A new algorithm for general matching problems using network flow subproblems (Q3829354) (← links)
- Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids (Q4910816) (← links)
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains (Q5321689) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM (Q5697484) (← links)
- Approximation and Online Algorithms (Q5896938) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
- Fast and simple approximation schemes for generalized flow. (Q5957564) (← links)