A Note on Optical Network with Nonsplitting Nodes
暂无分享,去创建一个
We study the problem of computing the minimum total weight multicast route in an optical network with both nonsplitting and splitting nodes, and present a simple approximation with performance ratio 3, which is better than existing one in the literature.
[1] Alex Zelikovsky,et al. Improved Steiner tree approximation in graphs , 2000, SODA '00.
[2] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Jitender S. Deogun,et al. Routing in sparse splitting optical networks with multicast traffic , 2003, Comput. Networks.