On the single-source unsplittable flow problem
From MaRDI portal
Recommendations
- Approximation algorithms for single-source unsplittable flow
- On the approximation of the single source \(k\)-splittable flow problem
- Implementing approximation algorithms for the single-source unsplittable flow problem
- Approximating the single source unsplittable min-cost flow problem
- On the minimum cost multiple-source unsplittable flow problem
- Approximation algorithms for the unsplittable flow problem
- scientific article; zbMATH DE number 1947047
- Improved bounds for the unsplittable flow problem
- New Algorithms for the Unsplittable Flow Problem
- Combinatorial algorithms for the unsplittable flow problem
Cited in
(44)- Single-source \(k\)-splittable min-cost flows
- Minimum-cost single-source 2-splittable flow
- Approximating the single source unsplittable min-cost flow problem
- Maximum edge-disjoint paths in planar graphs with congestion 2
- Single source unsplittable flows with arc-wise lower and upper bounds
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Algebraic theory on shortest paths for all flows
- Maximizing throughput in queueing networks with limited flexibility
- The matroid intersection cover problem
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- Approximation algorithms for single-source unsplittable flow
- A note on the ring loading problem
- Truthful unsplittable flow for large capacity networks
- Single-Sink Multicommodity Flow with Side Constraints
- On the minimum cost multiple-source unsplittable flow problem
- Approximability of unsplittable shortest path routing problems
- Improved algorithmic results for unsplittable stable allocation problems
- Minimum-Cost Single-Source 2-Splittable Flow
- Convex Combinations of Single Source Unsplittable Flows
- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
- Minimizing Average Flow-Time
- scientific article; zbMATH DE number 1342140 (Why is no real title available?)
- scientific article; zbMATH DE number 1947047 (Why is no real title available?)
- scientific article; zbMATH DE number 1775441 (Why is no real title available?)
- The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems
- Stochastic unsplittable flows
- Congestion-free rerouting of flows on DAGs
- Single source unsplittable flows with arc-wise lower and upper bounds
- An improved upper bound for the ring loading problem
- Network models with unsplittable node flows with application to unit train scheduling
- scientific article; zbMATH DE number 7121921 (Why is no real title available?)
- Algorithms – ESA 2004
- Algebraic theory on shortest paths for all flows
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Computing Nash equilibria for scheduling on restricted parallel links
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Integer and unsplittable multiflows in series-parallel digraphs
- Unsplittable multicommodity flows in outerplanar graphs
- Small additive error for unsplittable multicommodity flow in outerplanar graphs
- Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
- The \(k\)-splittable flow problem
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
- An exact approach for the maximum concurrent \(k\)-splittable flow problem
- On the approximation of the single source \(k\)-splittable flow problem
This page was built for publication: On the single-source unsplittable flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1125608)
