Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
From MaRDI portal
Publication:2099386
DOI10.1007/s10878-022-00941-3OpenAlexW4309326516MaRDI QIDQ2099386
Wei Wang, Majun Shi, Zishen Yang
Publication date: 23 November 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00941-3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On minimum submodular cover with submodular cost
- Design and analysis of approximation algorithms
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Greedy approximation for the minimum connected dominating set with labeling
- An analysis of the greedy algorithm for the submodular set covering problem
- Minimum non-submodular cover problem with applications
- Greedy approximations for minimum submodular cover with submodular cost
- Submodular functions and optimization.
This page was built for publication: Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
