Stochastic Unsplittable Flows
From MaRDI portal
Publication:5002608
DOI10.4230/LIPIcs.APPROX-RANDOM.2017.7zbMath1467.90004OpenAlexW2747677863MaRDI QIDQ5002608
No author found.
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/
Stochastic programming (90C15) Stochastic network models in operations research (90B15) Approximation algorithms (68W25) Flows in graphs (05C21)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Approximation algorithms for the unsplittable flow problem
- On the single-source unsplittable flow problem
- Meet and merge: approximation algorithms for confluent flows
- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- An improved approximation algorithm for resource allocation
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows
- Multicommodity demand flow in a tree and packing integer programs
- Single-Source Stochastic Routing
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract
- A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Stochastic combinatorial optimization via poisson approximation
This page was built for publication: Stochastic Unsplittable Flows
