Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms
Fields of Study & Subjects
Optimization and Search Problems
Random Matrices and Applications
Markov Chains and Monte Carlo Methods
Publication details
- Journal / source
- Electronic Communications in Probability
- Publisher
- Institute of Mathematical Statistics
- Volume
- 31
- Issue
- none
- Publication date
- 1 January 2026