Designing Least-Cost Nonblocking Broadband Networks
From MaRDI portal
Publication:4360132
DOI10.1006/jagm.1997.0866zbMath0884.68004MaRDI QIDQ4360132
J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner
Publication date: 20 October 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2716b03dc7adf935839404fb6ef33f57c160d9ab
68M10: Network design and communication in computer systems
Related Items
Computational Geometry Column 34, Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty, Unnamed Item, Exploring the Tractability of the Capped Hose Model, Robust network design: Formulations, valid inequalities, and computations, Affine routing for robust network design, Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty, Center of maximum-sum matchings of bichromatic points, Single-commodity robust network design with finite and hose demand sets, Competitive and deterministic embeddings of virtual networks, A comparison of routing sets for robust network design, Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE, Static and dynamic routing under disjoint dominant extreme demands, Dynamic vs. oblivious routing in network design, On improving optimal oblivious routing, Design of trees in the hose model: the balanced case, A capacitated hub location problem under hose demand uncertainty, Robust combinatorial optimization with knapsack uncertainty, Multipolar robust optimization, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, A note on hierarchical hubbing for a generalization of the VPN problem, Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors, On the approximability of robust network design, Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty, Generalized hose uncertainty in single-commodity robust network design, The robust network loading problem with dynamic routing, New discoveries of domination between traffic matrices, Robust optimal discrete arc sizing for tree-shaped potential networks, Network design with a discrete set of traffic matrices, On maximum-sum matchings of points, On the robustness of potential-based flow networks, Unnamed Item, Robust routing and optimal partitioning of a traffic demand polytope
