Convex Optimization for the Densest Subgraph and Densest Submatrix Problems
- 11 September 2020
- journal article
- research article
- Published by Springer Nature in Operations Research Forum
- Vol. 1 (3) , 1-24
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- University of Alabama (RG14678, RG14838)
This publication has 46 references indexed in Scilit:
- User-Friendly Tail Bounds for Sums of Random MatricesFoundations of Computational Mathematics, 2011
- Spectral clustering and the high-dimensional stochastic blockmodelThe Annals of Statistics, 2011
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Nuclear norm minimization for the planted clique and biclique problemsMathematical Programming, 2011
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Review, 2010
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite CliqueSIAM Journal on Computing, 2006
- COMMUNITY STRUCTURE IN JAZZAdvances in Complex Systems, 2003
- Challenges in web search enginesACM SIGIR Forum, 2002
- The maximum clique problemJournal of Global Optimization, 1994
- Stochastic blockmodels: First stepsSocial Networks, 1983