Author:
Björklund Andreas,Husfeldt Thore,Kaski Petteri,Koivisto Mikko
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Alon, N., Gutner, S.: Balanced hashing, color coding and approximate counting. Electronic Colloquium on Computational Complexity, Report TR09-12 (2009)
2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42, 844–856 (1995)
3. Bellman, R.: Combinatorial processes and dynamic programming. In: Bellman, R., Hall Jr., M. (eds.) Combinatorial Analysis. Proceedings of Symposia in Applied Mathematics 10, pp. 217–249. American Mathematical Society (1960)
4. Bellman, R.: Dynamic programming treatment of the travelling Salesman Problem. J. Assoc. Comput. Mach. 9, 61–63 (1962)
5. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion–exclusion. SIAM J. Comput. (to appear) Special Issue for FOCS 2006
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献