Optimal approximations made easy

Information Processing Letters（2022）

引用 2|浏览9

暂无评分

摘要

•We consider the fundamental result of Li, Long, and Srinivasan on optimal approximations for finite set systems.•We give a modular, intuitive proof of their result for finite set systems. The only tool we assume is Chernoff's bound.•This new proof can be covered in a single self-contained lecture in a geometry, algorithms or combinatorics course.

查看译文

关键词

Analysis of algorithms,Random sampling,VC theory,Chaining,Symmetrization

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要