Tight Approximation Bounds for Greedy Frugal Coverage Algorithms
Main Authors: | Caragiannis, I, Kaklamanis, C, Kyropoulou, M |
---|---|
Format: | Book |
Published: |
2011
|
Similar Items
-
Tight approximation bounds for combinatorial frugal coverage algorithms
by: Caragiannis, I, et al.
Published: (2013) -
Tight approximation bounds for combinatorial frugal coverage algorithms
by: Caragiannis, I, et al.
Published: (2012) -
An Improved Approximation Bound for Spanning Star Forest and Color Saving
by: Athanassopoulos, S, et al.
Published: (2009) -
Limitations of Deterministic Auction Design for Correlated Bidders
by: Caragiannis, I, et al.
Published: (2013) -
Limitations of deterministic auction design for correlated bidders
by: Kyropoulou, M, et al.
Published: (2016)