Showing math.OCShow all
2 papers · 1 filter
math.OC2026
Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming
Valentine Olanubi, Phineas Agar, Brendan Ames
We consider the densest submatrix problem, which seeks the submatrix of fixed size of a given binary matrix that contains the most nonzero entries. This problem is a natural genera…
math.OC2019
Convex optimization for the densest subgraph and densest submatrix problems
Polina Bombina, Brendan Ames
We consider the densest -subgraph problem, which seeks to identify the -node subgraph of a given input graph with maximum number of edges. This problem is well-known to be NP…