Author:
Pham Quang Dung,Deville Yves
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference16 articles.
1. Althaus, E., Polzin, T., & Daneshmand, S. V. (2003). Improving linear programming approaches for the Steiner tree problem. In Experimental and efficient algorithms. Lecture notes in computer science, 2003. (Vol. 2647/2003, pp. 1–14).
2. Cheung, S. Y., & Kumar, A. (1994). Efficient quorumcast routing algorithms. In Proceedings of INFOCOM’94 (pp. 840–847).
3. Chimani, M., Kandyba, M., & Ljubic, P. M. I. (2009). Obtaining optimal k-cardinality trees fast. ACM Journal of Experimental Algorithmics, 14(2), 5.1–5.23.
4. Comet (2011). Comet user manual, dynadec. http://dynadec.com/ . Accessed 15 Sept 2010.
5. Dilkina, B. N., & Gomes, C. P. (2010). Solving connected subgraph problems in wildlife conservation. In 6. 7th International conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2010) (pp. 102–116).
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献