Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack

Deshpande Amol; Hellerstein Lisa; Kletenik Devorah

首页> 外文期刊>ACM transactions on algorithms >Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack

【24h】

Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack

机译：随机子模块集覆盖的近似算法及其在布尔函数评估和最小背包中的应用

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We present a new approximation algorithm for the stochastic submodular set cover (SSSC) problem called adaptive dual greedy. We use this algorithm to obtain a 3-approximation algorithm solving the stochastic Boolean function evaluation (SBFE) problem for linear threshold formulas (LTFs). We also obtain a 3-approximation algorithm for the closely related stochastic min-knapsack problem and a 2-approximation for a variant of that problem.

机译：我们为随机子模块集覆盖（SSSC）问题提出了一种新的近似算法，称为自适应对偶贪婪。我们使用该算法来获得3-近似算法，以解决线性阈值公式（LTF）的随机布尔函数评估（SBFE）问题。对于紧密相关的随机最小背包问题，我们还获得了3-逼近算法;对于该问题的变体，我们也获得了2-逼近。

著录项

来源
《ACM transactions on algorithms》 |2016年第3期|共28页
作者
Deshpande Amol; Hellerstein Lisa; Kletenik Devorah;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类数学;
关键词
Sequential testing; Boolean function evaluation;

机译：顺序测试;布尔函数评估;

相似文献

外文文献
中文文献
专利

1. Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack [J] . Deshpande Amol, Hellerstein Lisa, Kletenik Devorah ACM transactions on algorithms . 2016,第3期

机译：随机子模块集覆盖的近似算法及其在布尔函数评估和最小背包中的应用
2. PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR SUBMODULAR COST SET COVER PROBLEMS WITH LINEAR/SUBMODULAR PENALTIES [J] . FENGMIN WANG, DACHUAN XU, DONGLEI DU, Numerical Algebra, Control and Optimization . 2015,第2期

机译：具有线性/亚模块惩罚性的亚模块成本集覆盖问题的本原逼近算法
3. A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications [J] . Warren B. POWELL, Jun MA 控制理论与应用（英文版） . 2011,第003期

机译：具有连续值函数逼近的随机算法及其在多维连续应用中的一些新的近似策略迭代算法的综述
4. Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover [C] . Amol Deshpande, Lisa Hellerstein, Devorah Kletenik Annual ACM-SIAM Symposium on Discrete Algorithms . 2014

机译：随机布尔函数评估和随机柱膜套装的近似算法
5. Stochastic Optimization Based on White-Box Deterministic Approximations: Models, Algorithms and Application to Service Networks [D] . Krishnamoorthy, Mohan. 2018

机译：基于白盒确定性近似的随机优化：模型，算法及其在服务网络中的应用
6. Fast Nonparametric Density-Based Clustering of Large Data Sets Using a Stochastic Approximation Mean-Shift Algorithm [O] . Ollivier Hyrien, Andrea Baran -1

机译：使用随机逼近均值漂移算法的大型数据集基于非参数密度的快速聚类
7. Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack [O] . Amol Deshpande, Lisa Hellerstein, Devorah Kletenik 2016

机译：随机子模块套件的近似算法，应用于布尔函数评估和Min-Whackack
8. Submodular Set Functions, Matroids and the Greedy Algorithm: Tight Worst-Case Bounds and Some Generalizations of the Rado-Edmonds Theorem. [R] . Conforti, M., Cornuejols, G. 1983

机译：子模集函数，拟阵和贪心算法：最差 - 最坏情况界和Rado-Edmonds定理的一些推广。

Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack

摘要

著录项

相似文献

相关主题

期刊订阅