Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost (Q3638069)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost |
scientific article |
Statements
Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost (English)
0 references
14 July 2009
0 references