A tight analysis of the greedy algorithm for set cover 论文

1996引用 251
DOIPDF
Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchOptimization and Search Problems
Optimization and Search ProblemsAdvanced Graph Theory ResearchComplexity and Algorithms in Graphs
相关技术:Optimization and Search ProblemsComplexity and Algorithms in Graphs
关系图谱

1

作者

2

相关技术

0

相关事件

0

相关文章

摘要

We establish significantly improved bounds on the performance of the greedy algorithm for approximating set cover.

作者查看全部 (1)

P

Petr Slavı́k

相关技术查看全部 (2)

Optimization and Search ProblemsComplexity and Algorithms in Graphs

相关事件

暂无数据

相关文章

暂无数据