AI Chat AI Image Generator AI Video Text to Speech

An analysis of the Greedy Algorithm for Stochastic Set Cover

03/20/2018

∙

by Srinivasan Parthasarathy, et al.

∙

∙

We show that the approximation ratio of the greedy algorithm for the stochastic set cover problem is H(m), the m-th Harmonic number, where m is the number of elements in the ground set.

page 1

page 2

page 3

page 4

research

∙ 02/01/2021

A Tight Bound for Stochastic Submodular Cover

We show that the Adaptive Greedy algorithm of Golovin and Krause (2011) ...

0 Lisa Hellerstein, et al. ∙

research

∙ 11/05/2018

An estimation of the greedy algorithm's accuracy for a set cover problem instance

For the set cover problem, by modifying the approach that leads to the p...

0 Alexander Prolubnikov, et al. ∙

research

∙ 10/29/2020

Iteratively reweighted greedy set cover

We empirically analyze a simple heuristic for large sparse set cover pro...

0 Marc Alexa, et al. ∙

research

∙ 07/30/2021

Beep-And-Sleep: Message and Energy Efficient Set Cover

We observe message-efficient distributed algorithms for the Set Cover pr...

0 Thorsten Götte, et al. ∙

research

∙ 02/06/2018

How to select the best set of ads: Can we do better than Greedy Algorithm?

Selecting the best set of ads is critical for advertisers for a given se...

0 Xinle Liu, et al. ∙

research

∙ 06/17/2018

Greedy and Local Ratio Algorithms in the MapReduce Model

MapReduce has become the de facto standard model for designing distribut...

0 Nicholas J. A. Harvey, et al. ∙

research

∙ 11/17/2010

On the approximation ability of evolutionary optimization with application to minimum set cover

Evolutionary algorithms (EAs) are heuristic algorithms inspired by natur...

0 Yang Yu, et al. ∙