Stochastic unsplittable flows

DOI10.4230/LIPICS.APPROX-RANDOM.2017.7MaRDI QIDQ5002608zbMATH OpenOpenAlexFDO

Authors

Publication date 28 July 2021

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2017/7556/pdf/LIPIcs-APPROX-RANDOM-2017-7.pdf/

zbMATH Keywords

approximation algorithmsconfluent flowsstochastic optimizationunsplittable flows

Mathematics Subject Classification ID

Flows in graphs (05C21) Approximation algorithms (68W25) Stochastic network models in operations research (90B15) Stochastic programming (90C15)

Recommendations

• Single-Source Stochastic Routing
• On the single-source unsplittable flow problem
• Combinatorial algorithms for the unsplittable flow problem
• scientific article; zbMATH DE number 1947047
• scientific article; zbMATH DE number 1757944

Cites work

• (Almost) Tight bounds and existence theorems for single-commodity confluent flows
• A constant factor approximation algorithm for unsplittable flow on paths
• A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
• Adaptivity and approximation for stochastic packing problems
• An improved approximation algorithm for \textsc{Resource Allocation}
• Approximate indexability and bandit problems with concave rewards and delayed feedback
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Approximation algorithms for budgeted learning problems
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
• Approximation algorithms for the unsplittable flow problem
• scientific article; zbMATH DE number 5899246 (Why is no real title available?)
• Improved approximation results for stochastic knapsack problems
• Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
• Meet and merge: approximation algorithms for confluent flows
• Multicommodity demand flow in a tree and packing integer programs
• On the single-source unsplittable flow problem
• Single-Source Stochastic Routing
• Stochastic combinatorial optimization via Poisson approximation
• Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
• When LP is the cure for your matching woes: improved bounds for stochastic matchings

Cited in

(3)

• Convex Combinations of Single Source Unsplittable Flows
• Single-Source Stochastic Routing
• A Mazing 2+∊ Approximation for Unsplittable Flow on a Path

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Stochastic unsplittable flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002608)