Approximating capacitated tree-routings in networks

DOI10.1007/s10878-009-9238-5zbMath1213.90215OpenAlexW2007645296MaRDI QIDQ630195

Ehab Morsy, Hiroshi Nagamochi

Publication date: 17 March 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9238-5

zbMATH Keywords

graph algorithmrouting problemstree cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Approximation algorithms for a capacitated network design problem
• Balancing minimum spanning trees and shortest-path trees
• An improved approximation algorithm for capacitated multicast routings in networks
• An improved approximation algorithm for multicast \(k\)-tree routing
• Approximating the Single-Sink Link-Installation Problem in Network Design
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Automata, Languages and Programming
• Computing and Combinatorics

This page was built for publication: Approximating capacitated tree-routings in networks