Martin Fürer, Huiwen Yu. Packing-Based Approximation Algorithm for the k-Set Cover Problem. In Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe, editors, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings. Volume 7074 of Lecture Notes in Computer Science, pages 484-493, Springer, 2011. [doi]
@inproceedings{FurerY11, title = {Packing-Based Approximation Algorithm for the k-Set Cover Problem}, author = {Martin Fürer and Huiwen Yu}, year = {2011}, doi = {10.1007/978-3-642-25591-5_50}, url = {http://dx.doi.org/10.1007/978-3-642-25591-5_50}, researchr = {https://researchr.org/publication/FurerY11}, cites = {0}, citedby = {0}, pages = {484-493}, booktitle = {Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, editor = {Takao Asano and Shin-Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, volume = {7074}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-25590-8}, }