Greedy approximations for minimum submodular cover with submodular cost

被引：0
|
作者：
Peng-Jun Wan
Ding-Zhu Du
Panos Pardalos
Weili Wu
机构：
[1] Illinois Institute of Technology,Department of Computer Science
[2] University of Texas at Dallas,Department of Computer Science
[3] University of Florida,Department of Industrial Engineering and System Science
来源：
Computational Optimization and Applications | 2010年 / 45卷
关键词：
Greedy approximations; Minimum submodular cover;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
It is well-known that a greedy approximation with an integer-valued polymatroid potential function f is H(γ)-approximation of the minimum submodular cover problem with linear cost where γ is the maximum value of f over all singletons and H(γ) is the γ-th harmonic number. In this paper, we establish similar results for the minimum submodular cover problem with a submodular cost (possibly nonlinear) and/or fractional submodular potential function f.
引用
收藏
页码：463 / 474
页数：11
相关论文
共 50 条
  • [1] Greedy approximations for minimum submodular cover with submodular cost
    Wan, Peng-Jun
    Du, Ding-Zhu
    Pardalos, Panos
    Wu, Weili
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2010, 45 (02) : 463 - 474
  • [2] Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
    Shi, Majun
    Yang, Zishen
    Wang, Wei
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
  • [3] Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
    Majun Shi
    Zishen Yang
    Wei Wang
    Journal of Combinatorial Optimization, 2023, 45
  • [4] On minimum submodular cover with submodular cost
    Hongjie Du
    Weili Wu
    Wonjun Lee
    Qinghai Liu
    Zhao Zhang
    Ding-Zhu Du
    Journal of Global Optimization, 2011, 50 : 229 - 234
  • [5] On minimum submodular cover with submodular cost
    Du, Hongjie
    Wu, Weili
    Lee, Wonjun
    Liu, Qinghai
    Zhang, Zhao
    Du, Ding-Zhu
    JOURNAL OF GLOBAL OPTIMIZATION, 2011, 50 (02) : 229 - 234
  • [6] Minimum Cost Adaptive Submodular Cover
    Cui, Yubing
    Nagarajant, Viswanath
    2023 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2023, : 12 - 27
  • [7] Submodular Cost Submodular Cover with an Approximate Oracle
    Crawford, Victoria G.
    Kuhnle, Alan
    Thai, My T.
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [8] An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover
    Crawford, Victoria G.
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 1227 - 1233
  • [9] Minimum Latency Submodular Cover
    Im, Sungjin
    Nagarajan, Viswanath
    Van der Zwaan, Ruben
    ACM TRANSACTIONS ON ALGORITHMS, 2016, 13 (01)
  • [10] Minimum Latency Submodular Cover
    Im, Sungjin
    Nagarajan, Viswanath
    van der Zwaan, Ruben
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 485 - 497
12345