Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for directed Steiner problems
Journal of Algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
A deterministic algorithm for the cost-distance problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Single-Sink Link-Installation Problem in Network Design
SIAM Journal on Optimization
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
TCP performance analysis on asymmetric networks composed of satellite and terrestrial links
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Hardness of Buy-at-Bulk Network Design
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
On non-uniform multicommodity buy-at-bulk network design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
BRA: a bidirectional routing abstraction for asymmetric mobile ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Improved approximating algorithms for Directed Steiner Forest
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Cost-Distance: Two Metric Network Design
SIAM Journal on Computing
A Constant Factor Approximation for the Single Sink Edge Installation Problem
SIAM Journal on Computing
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Hi-index | 0.00 |
Buy-at-bulk network design is a well-known problem that has been researched extensively on undirected graphs. In this paper, we initiate the theoretical study of the same problem on directed graphs, thus capturing real-life situations where the cost of installing capacity on an edge is asymmetric with respect to direction, as e.g. in the design of wireless and satellite communication networks. More specifically, we develop two approximation algorithms for directed buy-at-bulk network design in the non-uniform cost model. Combined, they achieve a ratio of O(min {k1/2+ε, n4/5+ε}) for any constant ε 0, where n is the number of nodes of the network and k is the number of demand pairs to be connected. Further, the above ratio is independent of the amount of traffic flow requested by each demand pair, which may vary arbitrarily, and it can be remarkably improved when all demand pairs share a common sink (or a common source, symmetrically). To the best of our knowledge, this is the first non-trivial approximation factor established for the aforementioned problem, and naturally it also applies to more restricted cost models, such as the uniform and rent-or-buy models. Moreover, it essentially matches the best currently known approximation guarantees for directed Steiner forest, which may be viewed as a special case of directed buy-at-bulk network design.