Approximation algorithms for the unsplittable flow problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1947047
- Approximation algorithms for the unsplittable flow problem on paths and trees
- Approximation algorithms for single-source unsplittable flow
- Implementing approximation algorithms for the single-source unsplittable flow problem
- Combinatorial algorithms for the unsplittable flow problem
- New Algorithms for the Unsplittable Flow Problem
- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
- A constant-factor approximation algorithm for unsplittable flow on paths
- A constant factor approximation algorithm for unsplittable flow on paths
- Improved bounds for the unsplittable flow problem
Cited in
(40)- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
- Scheduling split intervals with non-uniform demands
- Stochastic makespan minimization in structured set systems (extended abstract)
- Combinatorial approximation algorithms for generalized flow problems
- A note on the greedy algorithm for the unsplittable flow problem
- Improved bounds for the unsplittable flow problem
- Maximum bipartite flow in networks with adaptive channel width
- Algebraic theory on shortest paths for all flows
- Stochastic makespan minimization in structured set systems
- A quasi-PTAS for unsplittable flow on line graphs
- Stochastic unsplittable flows
- Improved algorithms for resource allocation under varying capacity
- Scheduling Resources for Throughput Maximization
- A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
- Packing cars into narrow roads: PTASs for limited supply highway
- scientific article; zbMATH DE number 7051239 (Why is no real title available?)
- Pricing on paths: a PTAS for the highway problem
- scientific article; zbMATH DE number 7278054 (Why is no real title available?)
- scientific article; zbMATH DE number 5899246 (Why is no real title available?)
- The \(k\)-splittable flow problem
- scientific article; zbMATH DE number 7121921 (Why is no real title available?)
- The prize-collecting call control problem on weighted lines and rings
- A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints
- Optimal interval scheduling with a resource constraint
- Approximation algorithms for the unsplittable flow problem on paths and trees
- Combinatorial algorithms for the unsplittable flow problem
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
- Submodular unsplittable flow on trees
- Resource allocation with time intervals
- A logarithmic approximation for unsplittable flow on line graphs
- Submodular unsplittable flow on trees
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
- On the single-source unsplittable flow problem
- scientific article; zbMATH DE number 1757944 (Why is no real title available?)
- Improved algorithms for scheduling unsplittable flows on paths
- scientific article; zbMATH DE number 1947047 (Why is no real title available?)
- Approximations for generalized unsplittable flow on paths with application to power systems optimization
- Meet and merge: approximation algorithms for confluent flows
- Algebraic theory on shortest paths for all flows
- A constant factor approximation algorithm for the storage allocation problem
This page was built for publication: Approximation algorithms for the unsplittable flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868438)
