Flow-Dependent Networks: Existence and Behavior at Steiner Points

Networks

Volumn 31, Issue 3, 1998, Pages 149-156

  Cox, Christopher L ^a  

^a OKLAHOMA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347565214     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199805)31:3<149::AID-NET1>3.0.CO;2-F     Document Type: Article

References (6)

1. C. L. Cox, Flow dependent networks. Undergraduate Honors Thesis, Williams College (1992).
2. D. Z. Du and F. K. Hwang, On a conjecture of Trietsch and Handler on the flow-dependent Steiner ratio. Networks 16 (1986) 47-50.
3. E. N. Gilbert, Minimal cost communication networks. Bell Syst. Tech. J. 46 (1967) 2209-2227.
4. E. N. Gilbert and H. O. Pollak, Steiner minimal trees. Bell Syst. Tech. J. 16 (1968) 1-29.
5. D. Trietsch, Minimal Euclidean networks with flow dependent costs - the generalized Steiner case. Discussion Paper No. 655, CEMSMS, Northwestern University (1985).
6. D. Trietsch and G. Y. Handler, The Gilbert and Pollak conjecture - a generalization. Networks 150 (1985) 365-380.