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 1339574-9. - Vol. 26.2013, 2, p. 292-309
|
Subject: | frugal coverage | set cover | set packing | approximation algorithms | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
The rank pricing problem : models and branch-and-cut algorithms
Calvete, Herminia I., (2019)
-
Goerigk, Marc, (2023)
-
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
Baïou, Mourad, (2023)
- More ...
-
Bounding the inefficiency of outcomes in generalized second price auctions
Caragiannis, Ioannis, (2015)
-
Tight approximation bounds for combinatorial frugal coverage algorithms
Caragiannis, Ioannis, (2013)
-
The efficiency of fair division
Caragiannis, Ioannis, (2009)
- More ...