29 citations · 45 across the 9 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
The Densest k-Subhypergraph Problem
Eden Chlamtáč, Michael Dinitz, Christian Konrad +2
The Densest -Subgraph (DS) problem, and its corresponding minimization problem Smallest -Edge Subgraph (SES), have come to play a central role in approximation algorith…
cs.DS2016
Computing approximate PSD factorizations
Amitabh Basu, Michael Dinitz, Xin Li
We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, bu…