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 条
  • [41] A Unified Continuous Greedy Algorithm for Submodular Maximization
    Feldman, Moran
    Naor, Joseph
    Schwartz, Roy
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 570 - 579
  • [42] Submodular optimization problems and greedy strategies: A survey
    Yajing Liu
    Edwin K. P. Chong
    Ali Pezeshki
    Zhenliang Zhang
    Discrete Event Dynamic Systems, 2020, 30 : 381 - 412
  • [43] Submodular optimization problems and greedy strategies: A survey
    Liu, Yajing
    Chong, Edwin K. P.
    Pezeshki, Ali
    Zhang, Zhenliang
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2020, 30 (03): : 381 - 412
  • [44] Online submodular welfare maximization: Greedy is optimal
    Kapralovy, Michael
    Post, Ian
    Vondrak, Jan
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1216 - 1225
  • [45] Unified Greedy Approximability Beyond Submodular Maximization
    Disser, Yann
    Weckbecker, David
    COMBINATORIAL OPTIMIZATION (ISCO 2022), 2022, 13526 : 299 - 311
  • [46] Smooth Interactive Submodular Set Cover
    He, Bryan
    Yue, Yisong
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
  • [47] Generalized submodular cover problems and applications
    Bar-Ilan, J
    Kortsarz, G
    Peleg, D
    THEORETICAL COMPUTER SCIENCE, 2001, 250 (1-2) : 179 - 200
  • [48] A note on submodular set cover on matroids
    Gargano, Luisa
    Hammar, Mikael
    DISCRETE MATHEMATICS, 2009, 309 (18) : 5739 - 5744
  • [49] The Power of Adaptivity for Stochastic Submodular Cover
    Ghuge, Rohan
    Gupta, Anupam
    Nagarajan, Viswanath
    OPERATIONS RESEARCH, 2024, 72 (03) : 1156 - 1176
  • [50] A strongly polynomial cut canceling algorithm for minimum cost submodular flow
    Iwata, S
    McCormick, ST
    Shigeno, M
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (02) : 304 - 320
12345