Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 4, Issue 1, Pages 53-57
http://dx.doi.org/10.1155/1996/43738

Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel Networks

1MEDS, J. L. Kellogg Graduate School of Management, Northwestern University, Evanston 60208, IL, USA
2USAir, Operations Research Department, 2345 Crystal Drive, Arlington 22227, VA, USA

Received 22 February 1994; Revised 3 February 1995

Copyright © 1996 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

Sunil Chopra and Kalyan T. Talluri, “Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel Networks,” VLSI Design, vol. 4, no. 1, pp. 53-57, 1996. https://doi.org/10.1155/1996/43738.