A factoring approach for the Steiner tree problem in undirected networks

Authors:
Chu-Fu Wang;Rong-Hong Jan
Affiliations:
Department of Computer Science, National Pingtung University of Education, No. 4-18, Ming Shen Road, Pingtung 90044, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 30050, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2007

Citing 14
Cited 2

On finding Steiner vertices

Networks
Steiner problem in networks: a survey

Networks
Problem reduction methods and a tree generation algorithm for the Steiner network problem

Networks
A faster approximation algorithm for the Steiner problem in graphs

Information Processing Letters
A note on “A faster approximation algorithm for the Steiner problem in graphs”

Information Processing Letters
Optimal reduction of two-terminal directed acyclic graphs

SIAM Journal on Computing
Distributed algorithms for multicast path setup in data networks

IEEE/ACM Transactions on Networking (TON)
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Universal approximations for TSP, Steiner tree, and set cover

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tighter Bounds for Graph Steiner Tree Approximation

SIAM Journal on Discrete Mathematics
Lower bounds for the relative greedy algorithm for approximating Steiner trees

Networks
A faster algorithm for the steiner tree problem

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

A novel ring-tree-based routing and wavelength assignment algorithm for multicasting in DWDM optical mesh networks

Information Sciences: an International Journal
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.07

Visualization

Abstract

In communication networks, many applications, such as video on demand and video conferencing, must establish a communications tree that spans a subset K in a vertex set. The source node can then send identical data to all nodes in set K along this tree. This kind of communication is known as multicast communication. A network optimization problem, called the Steiner tree problem (STP), is presented to find a least cost multicasting tree. In this paper, an O(|E|) algorithm is presented to find a minimum Steiner tree for series-parallel graphs where |E| is the number of edges. Based on this algorithm, we proposed an O(2^2^c.|E|) algorithm to solve the Steiner tree problem for general graphs where c is the number of applied factoring procedures. The c value is strongly related to the topology of a given graph. This is quite different from other algorithms with exponential time complexities in |K|.