Approximation algorithm for stochastic set cover problem
type: Item
instance of: scholarly article
title: Approximation algorithm for stochastic set cover problem
zbMATH Open document ID: 1482.68277
DOI: 10.1007/978-3-030-57602-8_4
author: Yanyan Li
publication date: 2021-07-05T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7367744
zbMATH Keywords: stochastic set cover
zbMATH Keywords: primal-dual
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: 978-3-030-57602-8 4
OpenAlex ID: W3047700137
cites work: Improved low-degree testing and its applications
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation''
cites work: On the hardness of approximating minimum vertex cover
cites work: A push-relabel framework for submodular function minimization and applications to parametric optimization
cites work: Approximation algorithms for partial covering problems
cites work: Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Submodular Function Minimization under Covering Constraints
cites work: Approximation algorithms for combinatorial problems
cites work: Reducibility among Combinatorial Problems
cites work: A unified approach to approximating partial covering problems
cites work: Approximation algorithms for stochastic combinatorial optimization problems
cites work: Hedging uncertainty: approximation algorithms for stochastic optimization problems
cites work: Q4527015
cites work: Improved performance of the greedy algorithm for partial cover
cites work: A primal-dual -approximation algorithm for the stochastic facility location problem with submodular penalties
cites work: Prospect Theory: An Analysis of Decision under Risk
description: scientific article; zbMATH DE number 7367744