首页> 美国政府科技报告 >Submodular Set Functions, Matroids and the Greedy Algorithm: Tight Worst-Case Bounds and Some Generalizations of the Rado-Edmonds Theorem

【24h】

Submodular Set Functions, Matroids and the Greedy Algorithm: Tight Worst-Case Bounds and Some Generalizations of the Rado-Edmonds Theorem

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

获取原文

页面导航

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

摘要

No abstract available.

著录项

作者
Conforti, M.; Cornuejols, G.;
展开▼
作者单位

展开▼
年度 1983
页码 p.1-40
总页数 40
原文格式 PDF
正文语种 eng
中图分类工业技术;
关键词
Combinatorial analysis; Optimization; Set theory; Algorithms; Solutions(General); Curvature; Heuristic methods;

机译：组合分析;优化;集合论;算法;解（通用）;曲率;启发式方法;

相似文献

外文文献
中文文献
专利

1. On greedy algorithms, partially ordered sets, and submodular functions [J] . B. L. Dietrich, A. J. Hoffman IBM Journal of Research and Development . 2003,第1期

机译：关于贪心算法，部分有序集和子模函数
2. On greedy algorithms, partially ordered sets, and submodular functions [J] . IBM Journal of Research and Development . 2003,第1期

机译：关于贪心算法，部分有序集和子模函数
3. The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems [J] . Ma Tengyu, Tang Bo, Wang Yajun Theory of computing systems . 2016,第4期

机译：若干次模拟阵拟阵秘书问题的仿真贪婪算法
4. The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems [C] . Tengyu Ma, Bo Tang, Yajun Wang International Symposium on Theoretical Aspects of Computer Science . 2013

机译：用于几个子模具Matroid秘书问题的模拟贪婪算法
5. Performance Bounds for Greedy Strategies in Submodular Optimization Problems [D] . Liu, Yajing. 2018

机译：子模具优化问题贪婪策略的性能界限
6. A GENERALIZATION OF WHITNEYS THEOREM ON IDEALS OF DIFFERENTIABLE FUNCTIONS [O] . Leopoldo Nachbin 1957

机译：关于微分函数理想的惠特尼定理的推广
7. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem [O] . Conforti, M., Cornuéjols, G. 1984

机译：次模集函数，拟阵和贪婪算法：紧的最坏情况边界和Rado-Edmonds定理的一些推广
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定理的一些推广。

Submodular Set Functions, Matroids and the Greedy Algorithm: Tight Worst-Case Bounds and Some Generalizations of the Rado-Edmonds Theorem

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅