{"paper":{"title":"Approximate k-Cover in Hypergraphs: Efficient Algorithms, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hung Nguyen, My Thai, Phuc Thai, Tam Vu, Thang Dinh","submitted_at":"2019-01-23T14:49:36Z","abstract_excerpt":"Given a weighted hypergraph $\\mathcal{H}(V, \\mathcal{E} \\subseteq 2^V, w)$, the approximate $k$-cover problem seeks for a size-$k$ subset of $V$ that has the maximum weighted coverage by \\emph{sampling only a few hyperedges} in $\\mathcal{E}$. The problem has emerged from several network analysis applications including viral marketing, centrality maximization, and landmark selection. Despite many efforts, even the best approaches require $O(k n \\log n)$ space complexities, thus, cannot scale to, nowadays, humongous networks without sacrificing formal guarantees. In this paper, we propose BCA, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07928","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}