Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-21204-8_22
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg