Approximating the Generalized Capacitated Tree-Routing Problem

DOI10.1007/978-3-540-69733-6_61MaRDI QIDQ3511374zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the approximation of the generalized capacitated tree-routing problem
• Approximating Capacitated Tree-Routings in Networks
• Approximating capacitated tree-routings in networks
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• An improved approximation algorithm for capacitated multicast routings in networks

Cites work

• Algorithms and Computation
• An 11/6-approximation algorithm for the network Steiner problem
• An improved approximation algorithm for capacitated multicast routings in networks
• Approximating Capacitated Tree-Routings in Networks
• Approximating the Generalized Capacitated Tree-Routing Problem
• Approximation algorithms for a capacitated network design problem
• Automata, Languages and Programming
• Computing and Combinatorics
• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• scientific article; zbMATH DE number 1305435 (Why is no real title available?)
• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• Improved Approximations for the Steiner Tree Problem
• Integer linear programming models for global routing
• New approximation algorithms for the Steiner tree problems
• RNC-approximation algorithms for the steiner problem
• The Rectilinear Steiner Tree Problem is NP-Complete

Cited in

(8)

• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• Capacitated ring arborescence problems with profits
• Approximating the Generalized Capacitated Tree-Routing Problem
• scientific article; zbMATH DE number 1303035 (Why is no real title available?)
• Approximation to the Minimum Cost Edge Installation Problem
• Approximating Capacitated Tree-Routings in Networks
• Approximating capacitated tree-routings in networks
• On the approximation of the generalized capacitated tree-routing problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511374)