Exact and Approximate Algorithms for Topological Design of Wide Area Networks with Non-simultaneous Single Commodity Flows

DOI10.1007/3-540-44864-0_82zbMath1188.68028OpenAlexW1546096622MaRDI QIDQ3569051

A. Kasprzak

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44864-0_82

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Maximizing residual capacity in connection-oriented networks

This page was built for publication: Exact and Approximate Algorithms for Topological Design of Wide Area Networks with Non-simultaneous Single Commodity Flows