Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference45 articles.
1. Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica 29(3), 410–421 (2001)
2. Feige, U.: Relations between average case complexity and approximation complexity. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 534–543. ACM (2002)
3. Khot, S.: Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. SIAM J. Comput. 36(4), 1025–1071 (2006)
4. Alon, N., Arora, S., Manokaran, R., Moshkovitz, D., Weinstein, O.: Inapproximability of densest $$\kappa $$ κ -subgraph from average-case hardness (2011)
5. Ames, B., Vavasis, S.: Nuclear norm minimization for the planted clique and biclique problems. Math. Program. 129(1), 1–21 (2011)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献