Approximation algorithms for stochastic minimum-norm combinatorial optimization

DOI10.1109/FOCS46700.2020.00094MaRDI QIDQ6943961zbMATH OpenFDO

Authors Sharat Ibrahimpur, Chaitanya Swamy

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00094

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(4)

• Configuration balancing for stochastic requests
• Minimum-norm load balancing Is (almost) as easy as minimizing makespan
• Approximate minimum tree cover in all symmetric monotone norms simultaneously
• New results on a general class of minimum norm optimization problems

This page was built for publication: Approximation algorithms for stochastic minimum-norm combinatorial optimization

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