On non-integer submodular set cover problem

DOI10.1007/978-3-319-68640-0_26MaRDI QIDQ1797564zbMATH OpenOpenAlexFDO

Authors Weili Wu, Guangmo Tong, Du Ding-Zhu

Publication date 22 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-68640-0_26

zbMATH Keywords

set cover problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Minimum non-submodular cover problem with applications
• Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
• Greedy approximations for minimum submodular cover with submodular cost
• On approximation of the submodular set cover problem
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem

Cited in

(2)

• Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
• Minimum non-submodular cover problem with applications

This page was built for publication: On non-integer submodular set cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1797564)