Stochastic makespan minimization in structured set systems
From MaRDI portal
Publication:2118147
DOI10.1007/s10107-021-01741-zOpenAlexW3216217390MaRDI QIDQ2118147
Anupam Gupta, Viswanath Nagarajan, Amit Kumar, Xiangkun Shen
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.11153
Stochastic network models in operations research (90B15) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for maximum independent set of pseudo-disks
- Approximation algorithms for the unsplittable flow problem
- A note on maximum independent sets in rectangle intersection graphs
- Independent set of intersection graphs of convex objects in 2D
- Multicommodity demand flow in a tree and packing integer programs
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Allocating Bandwidth for Bursty Connections
- Randomized metarounding
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- Stochastic Load Balancing on Unrelated Machines
- Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method
- Improved Bounds for the Union of Locally Fat Objects in the Plane
This page was built for publication: Stochastic makespan minimization in structured set systems