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 条
  • [21] A note on the submodular vertex cover problem with submodular penalties
    Kamiyama, Naoyuki
    THEORETICAL COMPUTER SCIENCE, 2017, 659 : 95 - 97
  • [22] Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
    Koufogiannakis, Christos
    Young, Neal E.
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 634 - 652
  • [23] Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
    Koufogiannakis, Christos
    Young, Neal E.
    ALGORITHMICA, 2013, 66 (01) : 113 - 152
  • [24] Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
    Christos Koufogiannakis
    Neal E. Young
    Algorithmica, 2013, 66 : 113 - 152
  • [25] PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR SUBMODULAR COST SET COVER PROBLEMS WITH LINEAR/SUBMODULAR PENALTIES
    Wang, Fengmin
    Xu, Dachuan
    Du, Donglei
    Wu, Chenchen
    NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2015, 5 (02): : 91 - 100
  • [26] Approximation algorithms for the submodular edge cover problem with submodular penalties
    Wang, Xin
    Gao, Suogang
    Hou, Bo
    Wu, Lidong
    Liu, Wen
    THEORETICAL COMPUTER SCIENCE, 2021, 871 (871) : 126 - 133
  • [27] Impact of Information in Greedy Submodular Maximization
    Grimsman, David
    Ali, Mohd. Shabbir
    Hespanha, Joao P.
    Marden, Jason R.
    2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2017,
  • [28] Parallel Double Greedy Submodular Maximization
    Pan, Xinghao
    Jegelka, Stefanie
    Gonzalez, Joseph
    Bradley, Joseph
    Jordan, Michael, I
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 27 (NIPS 2014), 2014, 27
  • [29] A faster capacity scaling algorithm for minimum cost submodular flow
    Fleischer, L
    Iwata, S
    McCormick, ST
    MATHEMATICAL PROGRAMMING, 2002, 92 (01) : 119 - 139
  • [30] The Online Submodular Cover Problem
    Gupta, Anupam
    Levin, Roie
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1525 - 1537
12345