An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks

DOI10.1007/11758501_18zbMATH Open1155.68314OpenAlexW1599558143MaRDI QIDQ3545013FDOQ3545013

Przemyslaw Ryba, A. Kasprzak

Publication date: 9 December 2008

Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758501_18

Mathematics Subject Classification ID

Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cited In (3)

• Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
• A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks
• A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access

This page was built for publication: An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545013)