论文信息 - Fixed Topology Steiner Trees and Spanning Forests with Applications in Network Communications

Fixed Topology Steiner Trees and Spanning Forests with Applications in Network Communications

We present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with various time-delay constraints. We study the spanning forest problem with bandwidth constraint. A polynomial-time algorithm is given. Those problems have applications in network communications.

Xiaohua Jia | Lusheng Wang | X. Jia | Lusheng Wang

[1] F. Hwang,et al. A linear time algorithm for full steiner trees , 1986 .

[2] David Sankoff,et al. Locating the vertices of a steiner tree in an arbitrary metric space , 1975, Math. Program..

[3] Dana S. Richards,et al. Steiner tree problems , 1992, Networks.

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[6] Xiaohua Jia,et al. Modeling and Simulations of Multicast Routing Algorithms for Advanced Network Applications , 1997, Simul..