加载中…
2011-07-21
Greedy Set Cover Estimations
Hakob Aslanyan
文献摘要
More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本
More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.
生成讲解博客的中文版本
生成AI智能校验的中文版本