Primal dual algorithm for partial set multi-cover

DOI10.1007/978-3-030-04651-4_25OpenAlexW2901780026MaRDI QIDQ2327119

Yishuo Shi, Yingli Ran, Zhao Zhang

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_25

zbMATH Keywords

approximation algorithmdensest \(l\)-subgraph problempartial set multi-cover problempositive influence seeding problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Approximation algorithm for the partial set multi-cover problem ⋮ A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem

This page was built for publication: Primal dual algorithm for partial set multi-cover