Algorithms and Computation
From MaRDI portal
Publication:5897936
DOI10.1007/11602613zbMath1152.68366OpenAlexW2304246803MaRDI QIDQ5897936
Tamás Terlaky, Anthony Vannelli, Hu Zhang
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Mathematical problems of computer architecture (68M07) Approximation algorithms (68W25)
Related Items (3)
Approximating the Generalized Capacitated Tree-Routing Problem ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ Packing trees in communication networks
This page was built for publication: Algorithms and Computation
