Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

被引：0
|
作者：
Christos Koufogiannakis
Neal E. Young
机构：
[1] University of California,Department of Computer Science and Engineering
[2] Riverside,undefined
来源：
Algorithmica | 2013年 / 66卷
关键词：
Covering; Linear programming; Approximation algorithms; Local ratio; Primal-dual; Vertex cover; Set cover; Integer linear programming; Online algorithms; Competitive analysis; Submodular cost; Paging; Caching;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper describes a simple greedy Δ-approximation algorithm for any covering problem whose objective function is submodular and non-decreasing, and whose feasible region can be expressed as the intersection of arbitrary (closed upwards) covering constraints, each of which constrains at most Δ variables of the problem. (A simple example is Vertex Cover, with Δ=2.) The algorithm generalizes previous approximation algorithms for fundamental covering problems and online paging and caching problems.
引用
收藏
页码：113 / 152
页数：39
相关论文
共 50 条
  • [1] 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
  • [2] Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
    Koufogiannakis, Christos
    Young, Neal E.
    ALGORITHMICA, 2013, 66 (01) : 113 - 152
  • [3] AN ANALYSIS OF THE GREEDY ALGORITHM FOR THE SUBMODULAR SET COVERING PROBLEM
    WOLSEY, LA
    COMBINATORICA, 1982, 2 (04) : 385 - 393
  • [4] 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
  • [5] Greedy approximations for minimum submodular cover with submodular cost
    Peng-Jun Wan
    Ding-Zhu Du
    Panos Pardalos
    Weili Wu
    Computational Optimization and Applications, 2010, 45 : 463 - 474
  • [6] Approximation Algorithm for Vertex Cover with Multiple Covering Constraints
    Hung, Eunpyeong
    Kao, Mong-Jen
    ALGORITHMICA, 2022, 84 (01) : 1 - 12
  • [7] Approximation Algorithm for Vertex Cover with Multiple Covering Constraints
    Eunpyeong Hung
    Mong-Jen Kao
    Algorithmica, 2022, 84 : 1 - 12
  • [8] GREEDY plus SINGLETON: An efficient approximation algorithm for k-submodular knapsack maximization
    Tang, Zhongzheng
    Chen, Jingwen
    Wang, Chenhao
    THEORETICAL COMPUTER SCIENCE, 2024, 984
  • [9] Greedy approximation by arbitrary sets
    Borodin, P. A.
    IZVESTIYA MATHEMATICS, 2020, 84 (02) : 246 - 261
  • [10] Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
    Shi, Majun
    Yang, Zishen
    Wang, Wei
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
12345