User menu

Solving the quorumcast routing problem by constraint programming

  1. Althaus Ernst, Polzin Tobias, Daneshmand Siavash Vahdati, Improving Linear Programming Approaches for the Steiner Tree Problem, Experimental and Efficient Algorithms (2003) ISBN:9783540402053 p.1-14, 10.1007/3-540-44867-5_1
  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).
  6. Dooms, G., & Katriel, I. (2006). The minimum spanning tree constraint. In 12th international conference on principles and practice of constraint programming (CP2006) (pp. 211–225).
  7. Dooms Grégoire, Katriel Irit, The “Not-Too-Heavy Spanning Tree” Constraint, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007) ISBN:9783540723967 p.59-70, 10.1007/978-3-540-72397-4_5
  8. Du B., Gu J., Tsang D.H.K., Wang W., Quorumcast routing by multispace search, 10.1109/glocom.1996.587595
  9. Li Shu, Melhem Rami, Znati Taieb, An efficient algorithm for constructing delay bounded minimum cost multicast trees, 10.1016/j.jpdc.2004.08.007
  10. Ljubić Ivana, Weiskircher René, Pferschy Ulrich, Klau Gunnar W., Mutzel Petra, Fischetti Matteo, An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem, 10.1007/s10107-005-0660-x
  11. Low Chor Ping, A fast search algorithm for the quorumcast routing problem, 10.1016/s0020-0190(98)00033-7
  12. Noronha Thiago F., Ribeiro Celso C., Santos Andréa C., Solving diameter-constrained minimum spanning tree problems by constraint programming, 10.1111/j.1475-3995.2010.00780.x
  13. Régin Jean-Charles, Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ISBN:9783540681540 p.233-247, 10.1007/978-3-540-68155-7_19
  14. Rossi, F., van Beek, P., & Walsh, T. (2006). Handbook of constraint programming. New York, U.S.A.: Elsevier Science Inc.
  15. She Qingya, Kannasoot Nipatjakorn, Jue Jason P., Kim Young-Chon, On finding minimum cost tree for multi-resource manycast in mesh networks, 10.1016/j.osn.2008.05.004
  16. Wang Bin, Hou Jennifer C., An efficient QoS routing algorithm for quorumcast communication, 10.1016/s1389-1286(03)00322-0
Bibliographic reference Pham Quang, , Dung ; Deville, Yves. Solving the quorumcast routing problem by constraint programming . In: Constraints : an international journal, Vol. 17, p. 1-23 (2012)
Permanent URL http://hdl.handle.net/2078.1/113413