Regular ArticleDesigning Least-Cost Nonblocking Broadband Networks
References (19)
- et al.
The Steiner problem with edge lengths 1 and 2
Inform. Process. Lett.
(1989) Mathematical Theory of Connecting Networks and Telephone Traffic
(1965)A study of nonblocking switching networks
Bell Systems Tech. J.
(1953)- J. A. Fingerhut, May 1994, Approximation Algorithms for Configuring Nonblocking Communication Networks, Washington...
- J. A. Fingerhut, R. Jackson, S. Suri, J. S. Turner, Design of nonblocking ATM...
- J. A. Fingerhut, R. Jackson, S. Suri, J. S. Turner, New models for network...
- et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
(1979) - et al.
Joint optimization of data network design and facility selection
IEEE J. Selected Areas Comm.
(1990) - et al.
MENTOR: An algorithm for mesh network topological optimization and routing
IEEE Trans. Comm.
(1991)
There are more references available in the full text version of this article.
Cited by (127)
Center of maximum-sum matchings of bichromatic points
2024, Discrete MathematicsRobust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty
2023, European Journal of Operational ResearchCitation Excerpt :The hybrid model comprises a hose model and an interval model. Duffield et al. (1999) and Fingerhut, Suri, & Turner (1997) introduce the hose model to model demand uncertainty in telecommunication networks. The model limits the total traffic associated with each node instead of estimating individual pairwise demands.
On the approximability of robust network design
2021, Theoretical Computer ScienceMultipolar robust optimization
2018, EURO Journal on Computational OptimizationRobust combinatorial optimization with knapsack uncertainty
2018, Discrete OptimizationHose-based cross-layer backbone network design with Benders decomposition
2023, SIGCOMM 2023 - Proceedings of the ACM SIGCOMM 2023 Conference
- *
E-mail: {jaf,jst,suri}@cs.wustl.edu.
Copyright © 1997 Academic Press. All rights reserved.