Search
Skip to Search Results- 3Approximation algorithms
- 1Capacitated Multicast Routing
- 1Capacitated multicast routing
- 1Computational biology
- 1Constrained bipartite matching
- 1Interval scheduling
-
2008
Cai, Zhipeng, Lin, Guohui, Want, Lusheng, Chen, Zhi-Zhong
Technical report TR08-06. The Capacitated Multicast Tree Routing Problem is considered, in which only a limited number of destination nodes are allowed to receive data in one routing tree and multiple routing trees are needed to send data from the source node to all destination nodes. The goal...
-
2004
Cai, Zhipeng, Lin, Guohui, Xue, Guoliang
Technical report TR04-12. For the Capacitated Multicast Routing Problem, we considered two models which are the Multicast k-Path Routing and the Multicast k-Tree Routing. We presented two improved approximation algorithms for them, which have worst case performance ratios of 3 and (2 + ρ) (ρ is...
-
2003
Chen, Zhi-Zhong, Xu, Ying, Wen, Jianjun, Lin, Guohui, Jiang, Tao, Xu, Dong, Rizzi, Romeo
Technical report TR03-07. Protein NMR peak assignment refers to the process of assigning a group of \"spin systems\" obtained experimentally to a protein sequence of amino acids. The automation of this process is still an unsolved and challenging problem in NMR protein structure determination....