Search papers, labs, and topics across Lattice.
UC Berkeley
1
0
Randomly subsampling edges can yield correlation clustering approximations that rival those of complete graphs, challenging existing lower bounds for general graphs.
