On minimum submodular cover with submodular cost

DOI10.1007/s10898-010-9563-3zbMath1219.90138OpenAlexW2059655733MaRDI QIDQ540698

Ding-Zhu Du, Hongjie Du, Weili Wu, Zhao Zhang, Qinghai Liu, Won Jun 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

zbMATH Keywords

minimum submodular coverMOC-CDSsubmodular cost

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (6)

A cross-monotonic cost-sharing scheme for the concave facility location game ⋮ Minimum non-submodular cover problem with applications ⋮ On the approximability and hardness of the minimum connected dominating set with routing cost constraint ⋮ A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph ⋮ Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem ⋮ PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs

Cites Work

• Unnamed Item
• An analysis of the greedy algorithm for the submodular set covering problem
• Greedy approximations for minimum submodular cover with submodular cost
• EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS

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