2 papers
cs.DS2026
Fast and Simple Densest Subgraph with Predictions
Thai Bui, Luan Nguyen, Hoa T. Vu
We study the densest subgraph problem and its NP-hard densest at-most- subgraph variant through the lens of learning-augmented algorithms. We show that, given a reasonably accur…
cs.DS2024
Massively Parallel Maximum Coverage Revisited
Thai Bui, Hoa T. Vu
We study the maximum set coverage problem in the massively parallel model. In this setting, sets that are subsets of a universe of elements are distributed among machin…