Kaklamanis Christos

Christos Kaklamanis

Information about the author Christos Kaklamanis will soon be added to the site.
Found 1 papers in total
Tight approximation bounds for combinatorial frugal coverage algorithms
2013
We consider the frugal coverage problem, an interesting variation of set cover defined...
Papers per page: