Funder
National Science Foundation
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference21 articles.
1. Minimizing the union: tight approximations for small set bipartite vertex expansion;Chlamtáč,2017
2. A threshold of ln n for approximating set cover;Feige;J. ACM,1998
3. Optimal packing and covering in the plane are NP-complete;Fowler;Inf. Process. Lett.,1981
4. The densest k-subhypergraph problem;Chlamtác;SIAM J. Discrete Math.,2018
5. The dense k-subgraph problem;Feige;Algorithmica,2001
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献