On minimum submodular cover with submodular cost

DOI10.1007/S10898-010-9563-3zbMATH Open1219.90138OpenAlexW2059655733MaRDI QIDQ540698FDOQ540698

Authors: Hongjie Du, Weili Wu, Qinghai Liu, Zhao Zhang, Du Ding-Zhu, Wonjun Lee 

Publication date: 3 June 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9563-3

Recommendations

• Greedy approximations for minimum submodular cover with submodular cost
• Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
• Minimum non-submodular cover problem with applications
• On approximation of the submodular set cover problem
• Submodular function minimization under a submodular set covering constraint
• The minimum entropy submodular set cover problem
• On submodular function minimization
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties

zbMATH Keywords

minimum submodular coverMOC-CDSsubmodular cost

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• An analysis of the greedy algorithm for the submodular set covering problem
• Title not available (Why is that?)
• Efficient distributed algorithms for topology control problem with shortest path constraints
• Greedy approximations for minimum submodular cover with submodular cost

Cited In (10)

• On the approximability and hardness of the minimum connected dominating set with routing cost constraint
• PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
• A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem
• Submodular function minimization under a submodular set covering constraint
• Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
• Minimum non-submodular cover problem with applications
• Greedy approximations for minimum submodular cover with submodular cost
• A cross-monotonic cost-sharing scheme for the concave facility location game
• Minimization problems with non-submodular cover constraint
• A PTAS for weak minimum routing cost connected dominating set of unit disk graph

This page was built for publication: On minimum submodular cover with submodular cost

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