Quantitative analysis of flow distributions in a multiuser telecommunication network
From MaRDI portal
Publication:6178133
DOI10.1134/s1064230723020132OpenAlexW4387209692MaRDI QIDQ6178133
Yu. E. Malashenko, Irina A. Nazarova
Publication date: 18 January 2024
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064230723020132
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(k\)-splittable flow problem
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Fair optimization and networks: a survey
- Max-min fairness in multi-commodity flows
- Optimal Network Design with End-to-End Service Requirements
This page was built for publication: Quantitative analysis of flow distributions in a multiuser telecommunication network