Minimum Latency Submodular Cover

DOI10.1007/978-3-642-31594-7_41zbMath1272.90071arXiv1110.2207OpenAlexW2568156492WikidataQ57371665 ScholiaQ57371665MaRDI QIDQ2843274

Viswanath Nagarajan, Sungjin Im, Ruben van der Zwaan

Publication date: 12 August 2013

Published in: ACM Transactions on Algorithms, Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.2207

zbMATH Keywords

stochastic optimizationschedulingapproximationsequencingsubmodular covercovering Steiner tree

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (7)

Non-adaptive stochastic score classification and explainable halfspace evaluation ⋮ Unnamed Item ⋮ Tight approximation algorithms for ordered covering ⋮ Adaptive Submodular Ranking and Routing ⋮ The stochastic Boolean function evaluation problem for symmetric Boolean functions ⋮ Unnamed Item ⋮ A Tight Bound for Stochastic Submodular Cover

This page was built for publication: Minimum Latency Submodular Cover