Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Christos Kaklamanis
Information about the author Christos Kaklamanis will soon be added to the site.
Found
1 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
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:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
