Convex Optimization for the Densest Subgraph and Densest Submatrix Problems-Reference-Cited by-同舟云学术

Convex Optimization for the Densest Subgraph and Densest Submatrix Problems

Published:2020-09 Issue:3 Volume:1 Page:
ISSN:2662-2556
Container-title:SN Operations Research Forum
language:en
Short-container-title:SN Oper. Res. Forum

Author:

Bombina Polina,Ames Brendan^ORCID

Funder

University of Alabama

Publisher

Springer Science and Business Media LLC

Link

https://link.springer.com/content/pdf/10.1007/s43069-020-00020-5.pdf

Reference62 articles.

1. Karp R (1972) Reducibility among combinatorial problems. Complexity of Computer Computations 40(4):85–103

2. Alon N, Arora S, Manokaran R, Moshkovitz D, Weinstein O (2011) Inapproximability of densest κ-subgraph from average case hardness. Unpublished manuscript 1

3. Feige U (2002) Relations between average case complexity and approximation complexity. In: Proceedings of the thiry-fourth annual ACM symposium on theory of computing. ACM, pp 534–543

4. Khot S (2006) Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J Comput 36(4):1025–1071

5. Henzinger MR, Motwani R, Silverstein C (2002) Challenges in web search engines. In: ACM SIGIR forum, vol 36. ACM, pp 11–22

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Survey on the Densest Subgraph Problem and its Variants;ACM Computing Surveys;2024-04-30

2. Sum-of-Squares Lower Bounds for Densest k-Subgraph;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation;IEEE Access;2023

4. Classifier Construction Under Budget Constraints;Proceedings of the 2022 International Conference on Management of Data;2022-06-10