Provisioning a virtual private network: A network design problem for multicommodity flow

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 389-398

  Gupta, Anupam ^a   Kleinberg, Jon ^a   Kumar, Amit ^a   Rastogi, Rajeev ^b   Yener, Bulent ^b  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; FREQUENCY ALLOCATION; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS); VIRTUAL REALITY;

NETWORK DESIGN PROBLEMS; VIRTUAL PRIVATE NETWORKS (VPN);

PERSONAL COMMUNICATION SYSTEMS;

EID: 0034832757     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. A 3-approximation algorithm for the k-level uncapacitated facility location problem
2. The access network design problem
3. Approximating the tree and tour covers of a graph
4. Buy-at-bulk network design
5. Improved combinatorial algorithms for the facility location and k-median problems
6. A flexible model for resource management in virtual private networks
7. ATM virtual private networks
8. Improved approximation algorithms for network design problems
9. Hierarchical placement and network design problems
10. A factor 2 approximation algorithm for the generalized Steiner network problem
11. Primal-dual approximation algorithms for metric facility location and k-median problems
12. Building Steiner trees with incomplete global knowledge
13. Approximation algorithms for geometric median problems
14. ε-approximations with minimum packing constraint violation (extended abstract)
15. Matching theory
16. Improved Steiner tree approximation in graphs
17. Buy-at-bulk network design: Approximating the single-sink edge installation problem
18. Approximation algorithms for facility location problems
19. A primal-dual approximation algorithm for generalized Steiner network problems