Preprint
Aug 2026
From Enumeration to Covering: Near-Optimal Densest P-Partite Subgraph Search over Large Heterogeneous Information Networks
This work casts each fixed-weight subproblem as a weighted supermodular densest-subgraph instance and solves it near-optimally, lifting the overall guarantee to $(1-\delta)/(1+\eta)$.
Lu Chen, Chengfei Liu, Rui Zhou et al.
· 0 citations