Approximating Capacitated Tree-Routings in Networks

DOI10.1007/978-3-540-72504-6_31zbMath1198.68300OpenAlexW1559701296MaRDI QIDQ5425447

Ehab Morsy, Hiroshi Nagamochi

Publication date: 13 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_31

zbMATH Keywords

Approximation AlgorithmGraph AlgorithmNetwork OptimizationRouting ProblemsTree Cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Approximating the Generalized Capacitated Tree-Routing Problem ⋮ On the approximation of the generalized capacitated tree-routing problem

This page was built for publication: Approximating Capacitated Tree-Routings in Networks