A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Designing least-cost nonblocking broadband networks
Journal of Algorithms
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Beyond Steiner's Problem: A VLSI Oriented Generalization
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Complexity of Approximating the Class Steiner Tree Problem
The Complexity of Approximating the Class Steiner Tree Problem
An improved approximation algorithm for virtual private network design
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
New approaches for virtual private network design
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Virtual private network design: a proof of the tree routing conjecture on ring networks
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Journal of the ACM (JACM)
Hi-index | 0.01 |
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one another. Each terminal is equipped with an upper bound on the amount of traffic that the terminal can send or receive. The task is to install capacities at minimum cost and to compute paths for each unordered terminal pair such that each valid traffic matrix can be routed along those paths. In this paper we consider a variant of the virtual private network design problem which generalizes the previously studied symmetric and asymmetric case. In our model the terminal set is partitioned into a number of groups, where terminals of each group do not communicate with each other. Our main result is a 4.74 approximation algorithm for this problem.