With a reasonably accurate predictor for nodes in the solution, simple linear-time algorithms achieve (1-ε) approximation for densest subgraph and its densest at-most-k variant.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast and Simple Densest Subgraph with Predictions
With a reasonably accurate predictor for nodes in the solution, simple linear-time algorithms achieve (1-ε) approximation for densest subgraph and its densest at-most-k variant.