Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada. Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. In Hung Q. Ngo, editor, Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings. Volume 5609 of Lecture Notes in Computer Science, pages 56-65, Springer, 2009. [doi]
@inproceedings{IzumiIOW09,
title = {Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem},
author = {Tomoko Izumi and Taisuke Izumi and Hirotaka Ono and Koichi Wada},
year = {2009},
doi = {10.1007/978-3-642-02882-3_7},
url = {http://dx.doi.org/10.1007/978-3-642-02882-3_7},
tags = {certification},
researchr = {https://researchr.org/publication/IzumiIOW09},
cites = {0},
citedby = {0},
pages = {56-65},
booktitle = {Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings},
editor = {Hung Q. Ngo},
volume = {5609},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-02881-6},
}