Tight approximation bounds for combinatorial frugal coverage algorithms
Year of publication: |
2013
|
---|---|
Authors: | Caragiannis, Ioannis ; Kaklamanis, Christos ; Kyropoulou, Maria |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 13395749. - Vol. 26.2013, 2, p. 292-309
|
Saved in:
Saved in favorites
Similar items by person
-
Bounding the inefficiency of outcomes in generalized second price auctions
Caragiannis, Ioannis, (2015)
-
The efficiency of fair division
Caragiannis, Ioannis, (2009)
-
Tight approximation bounds for combinatorial frugal coverage algorithms
Caragiannis, Ioannis, (2013)
- More ...