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 条
  • [31] Fast cycle canceling algorithms for minimum cost submodular flow
    Iwata, S
    McCormick, ST
    Shigeno, M
    COMBINATORICA, 2003, 23 (03) : 503 - 525
  • [32] A faster capacity scaling algorithm for minimum cost submodular flow
    Lisa Fleischer
    Satoru Iwata
    S. Thomas McCormick
    Mathematical Programming, 2002, 92 : 119 - 139
  • [33] An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
    Dai, Han
    COMPUTATION, 2022, 10 (10)
  • [34] Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*
    Satoru Iwata†
    S. Thomas Mccormick‡
    Maiko Shigeno§
    Combinatorica, 2003, 23 : 503 - 525
  • [35] A STRONGLY POLYNOMIAL ALGORITHM FOR MINIMUM COST SUBMODULAR FLOW PROBLEMS
    FUJISHIGE, S
    ROCK, H
    ZIMMERMANN, U
    MATHEMATICS OF OPERATIONS RESEARCH, 1989, 14 (01) : 60 - 69
  • [36] Approximation algorithms for the minimum power cover problem with submodular/linear penalties
    Liu, Xiaofei
    Li, Weidong
    Dai, Han
    THEORETICAL COMPUTER SCIENCE, 2022, 923 : 256 - 270
  • [37] Instance Specific Approximations for Submodular Maximization
    Balkanski, Eric
    Qian, Sharon
    Singer, Yaron
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [38] SAGA: A Submodular Greedy Algorithm for Group Recommendation
    Parambath, Shameem A. Puthiya
    Vijayakumar, Nishant
    Chawla, Sanjay
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 3900 - 3908
  • [39] Strategic Information Sharing in Greedy Submodular Maximization
    Grimsman, David
    Hespanha, Joao P.
    Marden, Jason R.
    2018 IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2018, : 2722 - 2727
  • [40] UNIFIED GREEDY APPROXIMABILITY BEYOND SUBMODULAR MAXIMIZATION
    Disser, Yann
    Weckbecker, David
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (01) : 348 - 379
12345