Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost |
scientific article |
Statements
Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (English)
0 references
16 May 2013
0 references
covering
0 references
linear programming
0 references
approximation algorithms
0 references
local ratio
0 references
primal-dual
0 references
vertex cover
0 references
set cover
0 references
integer linear programming
0 references
online algorithms
0 references
competitive analysis
0 references
submodular cost
0 references
paging
0 references
caching
0 references
0 references
0 references
0 references
0 references
