Approximating the Generalized Capacitated Tree-Routing Problem

DOI10.1007/978-3-540-69733-6_61zbMath1148.68420OpenAlexW1591100598MaRDI QIDQ3511374

Ehab Morsy, Hiroshi Nagamochi

Publication date: 10 July 2008

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-69733-6_61

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New approximation algorithms for the Steiner tree problems
• Approximation algorithms for a capacitated network design problem
• An 11/6-approximation algorithm for the network Steiner problem
• An improved approximation algorithm for capacitated multicast routings in networks
• Integer Linear Programming Models for Global Routing
• Approximating the Generalized Capacitated Tree-Routing Problem
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Improved Approximations for the Steiner Tree Problem
• RNC-approximation algorithms for the steiner problem
• Approximating Capacitated Tree-Routings in Networks
• Automata, Languages and Programming
• Computing and Combinatorics
• Algorithms and Computation

This page was built for publication: Approximating the Generalized Capacitated Tree-Routing Problem