Approximation algorithm for the 2-stage stochastic matroid base problem

DOI10.1016/j.orl.2022.01.004OpenAlexW4205391410MaRDI QIDQ2670486

Ziye Tang, Takuro Fukunaga, R. Ravi, Oleksandr Rudenko

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.01.004

zbMATH Keywords

greedy algorithmsubmodular set covertwo-stage stochastic matroid base problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• An analysis of the greedy algorithm for the submodular set covering problem
• List coloring of matroids and base exchange properties
• On Two-Stage Stochastic Minimum Spanning Trees

This page was built for publication: Approximation algorithm for the 2-stage stochastic matroid base problem