Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Work
Year: 2012
Type: article
Source: Algorithmica
Institution University of California, Riverside
Cites: 70
Cited by: 54
Related to: 10
FWCI: 5.445
Citation percentile (by year/subfield): 98.43
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green