Author:
Izumi Tomoko,Izumi Taisuke,Ono Hirotaka,Wada Koichi
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms 2(2), 153–177 (2006)
2. Arora, S., Lund, C.: Hardness of approximation. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard problems, pp. 399–446. PWS publishing company (1995)
3. Capkun, S., Buttyan, L., Hubaux, J.-P.: Self-organized public-key management for mobile ad hoc networks. IEEE Transactions on Mobile Computing 2(1), 52–64 (2003)
4. Chlebík, M., Chlebíková, J.: Complexity of approximating bounded variants of optimization problems. Theoretical Computer Science 354(3), 320–338 (2006)
5. Gouda, M.G., Jung, E.: Certificate dispersal in ad-hoc networks. In: Proceeding of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), March 2004, pp. 616–623 (2004)