Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Copyright policy )Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
This paper describes a simple greedy D-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 D variables of the problem. (A simple example is Vertex Cover, with D = 2.) The algorithm generalizes previous approximation algorithms for fundamental covering problems and online paging and caching problems.
- University of California System United States
- University of California, San Francisco United States
- University of California, Riverside United States
FOS: Computer and information sciences, Combinatorial optimization, online algorithms, submodular cost, G.1.6, Submodular cost, Caching, set cover, Computation Theory & Mathematics, integer linear programming, Vertex cover, caching, primal-dual, Linear programming, Computer Science - Data Structures and Algorithms, Paging, competitive analysis, Data Structures and Algorithms (cs.DS), approximation algorithms, Covering, Local ratio, Competitive analysis, Online algorithms, paging, Integer programming, linear programming, Primal-dual, covering, Approximation algorithms, local ratio, vertex cover, 68W25, Integer linear programming, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), Set cover
FOS: Computer and information sciences, Combinatorial optimization, online algorithms, submodular cost, G.1.6, Submodular cost, Caching, set cover, Computation Theory & Mathematics, integer linear programming, Vertex cover, caching, primal-dual, Linear programming, Computer Science - Data Structures and Algorithms, Paging, competitive analysis, Data Structures and Algorithms (cs.DS), approximation algorithms, Covering, Local ratio, Competitive analysis, Online algorithms, paging, Integer programming, linear programming, Primal-dual, covering, Approximation algorithms, local ratio, vertex cover, 68W25, Integer linear programming, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), Set cover
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).30 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!