Unsplittable Anycast Flow Problem: Formulation and Algorithms
From MaRDI portal
Publication:3545051
DOI10.1007/11758501_83zbMath1155.68315OpenAlexW1534529278MaRDI QIDQ3545051
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_83
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (1)
This page was built for publication: Unsplittable Anycast Flow Problem: Formulation and Algorithms