Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)

DOI10.1007/978-3-030-45771-6_13zbMath1503.90109OpenAlexW3016159584MaRDI QIDQ5041742

Xiangkun Shen, Anupam Gupta, Amit Kumar, Viswanath Nagarajan

Publication date: 14 October 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_13

zbMATH Keywords

expected maximum loadLP integrality gapstrong LP relaxation

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

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
• Stochastic makespan minimization in structured set systems
• Independent set of intersection graphs of convex objects in 2D
• Coloring and Maximum Independent Set of Rectangles
• Multicommodity demand flow in a tree and packing integer programs
• Allocating Bandwidth for Bursty Connections
• Stochastic ℓ_p Load Balancing and Moment Problems via the L-Function Method
• How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking

This page was built for publication: Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)