13 citations · 27 across the 6 of their papers we have counts for
5 papers · 1 filter
Flowless: Extracting Densest Subgraphs Without Flow Computations
Digvijay Boob, Yu Gao, Richard Peng +4
We propose a simple and computationally efficient method for dense subgraph discovery, which is a classic problem both in theory and in practice. It is well known that dense subgra…
Faster width-dependent algorithm for mixed packing and covering LPs
Digvijay Boob, Saurabh Sawlani, Di Wang
In this paper, we give a faster width-dependent algorithm for mixed packing-covering LPs. Mixed packing-covering LPs are fundamental to combinatorial optimization in computer scien…
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
David Durfee, Laxman Dhulipala, Janardhan Kulkarni +3
In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In thi…
ZeroER: Entity Resolution using Zero Labeled Examples
Renzhi Wu, Sanya Chaba, Saurabh Sawlani +2
Entity resolution (ER) refers to the problem of matching records in one or more relations that refer to the same real-world entity. While supervised machine learning (ML) approache…
Near-Optimal Fully Dynamic Densest Subgraph
Saurabh Sawlani, Junxing Wang
We give the first fully dynamic algorithm which maintains a -approximate densest subgraph in worst-case time per update. Dense subgraph discove…