Pages that link to "Item:Q5957564"
From MaRDI portal
The following pages link to Fast and simple approximation schemes for generalized flow. (Q5957564):
Displaying 12 items.
- Distributive lattices, polyhedra, and generalized flows (Q607363) (← 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)
- Maximum flows in generalized processing networks (Q2012883) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- (Q5020876) (← links)
- Efficient Approximation of Flow Problems With Multiple Scales in Time (Q5117149) (← links)
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains (Q5321689) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
- Generalized maximum flow over time with intermediate storage (Q6546986) (← links)