A factoring approach for the Steiner tree problem in undirected networks-Reference-Cited by-同舟云学术

A factoring approach for the Steiner tree problem in undirected networks

Published:2007-06 Issue:12 Volume:177 Page:2418-2435
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Wang Chu-Fu,Jan Rong-Hong

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference35 articles.

1. Solving Steiner tree problems in graphs with lagrangian relaxation;Bahiense;Journal of Combinatorial Optimization,2003

2. Problem reduction methods and a tree generation algorithm for the Steiner network problem;Balakrishnan;Networks,1987

3. Distributed algorithms for multicast path setup in data networks;Bauer;IEEE/ACM Trans. on Networking,1996

4. An algorithm for the Steiner problem in graphs;Beasley;Networks,1984

5. Optimal reduction of two-terminal directed acyclic graphs;Bein;SIAM Journal on Computing,1992

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An improved EDA for solving Steiner tree problem;Concurrency and Computation: Practice and Experience;2015-03-17

2. An Estimation of Distribution Algorithm for Steiner Tree Problem;2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing;2013-11

3. QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms;Journal of Network and Computer Applications;2010-07

4. A novel ring-tree-based routing and wavelength assignment algorithm for multicasting in DWDM optical mesh networks;Information Sciences;2007-12