Stochastic makespan minimization in structured set systems

DOI10.1007/S10107-021-01741-ZOpenAlexW3216217390MaRDI QIDQ2118147FDOQ2118147

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

zbMATH Keywords

linear programmingstochastic optimizationapproximation algorithmsgeometric packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Stochastic network models in operations research (90B15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Allocating Bandwidth for Bursty Connections
• Independent set of intersection graphs of convex objects in 2D
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Approximation algorithms for the unsplittable flow problem
• Randomized metarounding
• A note on maximum independent sets in rectangle intersection graphs
• Improved Bounds for the Union of Locally Fat Objects in the Plane
• Approximation algorithms for maximum independent set of pseudo-disks
• Improved Approximation Guarantees for Packing and Covering Integer Programs
• Multicommodity demand flow in a tree and packing integer programs
• Stochastic Load Balancing on Unrelated Machines
• Stochastic ℓ_p Load Balancing and Moment Problems via the L-Function Method

Cited In (1)

• Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)

This page was built for publication: Stochastic makespan minimization in structured set systems

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