Anupam Gupta, Jon Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener  Home/Search
Context Related
Links: DBLP | cornell.edu/home/kleinb...stoc01vpn.ps From: cornell.edu/home/klein...kleinber (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Consider a setting in which a group of nodes, situated in a large underlying network, wishes (Update)
Cited by: More
Efficient and Robust Routing of Highly Variable Traffic - Murali Kodialam Lakshman (2004) (Correct)
Maximum Throughput Routing of - Traffic In The (Correct)
Multilateral Transport Games - Shepherd, Wilfong (Correct)
Similar documents (at the sentence level):
65.0%: Provisioning a Virtual Private Network: A Network Design.. - Gupta, al. (2000) (Correct)
Active bibliography (related documents): More All
2.4: Approximation Algorithms for Facility Location Problems - Jens Vygen (2005) (Correct)
0.2: Approximation Algorithms for Concave Cost Network Flow Problems - Munagala (2003) (Correct)
0.1: Towards a Katona type proof for the 2-intersecting.. - Howard, Károlyi (2001) (Correct)
Similar documents based on text: More All
0.7: Exploring the Trade-off Between Label Size and Stack Depth in.. - Gupta, Kumar (2003) (Correct)
0.6: Universal-Stability Results and Performance Bounds .. - Andrews.. (Correct)
0.4: Traveling with a Pez Dispenser - Gupta, Kumar, Rastogi (Correct)
Related documents from co-citation: More All
13: Building steiner trees with incomplete global knowledge (context) - Karger, Minkoff - 2000
9: A flexible model for resource management in virtual private networks - Duffield, Goyal et al. - 1999
8: Hierarchical placement and network design problems - Guha, Meyerson et al. - 2000
BibTeX entry: (Update)
A. Gupta, A. Kumar, J. Kleinberg R. Rastogi, and B. Yener, "Provisioning a virtual private network: A network design problem for multicommodity flow," in Proceedings ACM STOC, 2001. http://citeseer.ist.psu.edu/article/gupta01provisioning.html More
@inproceedings{ gupta01provisioning,
author = "Anupam Gupta and Jon M. Kleinberg and Amit Kumar and Rajeev Rastogi and Bulent Yener",
title = "Provisioning a virtual private network: a network design problem for multicommodity flow",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "389-398",
year = "2001",
url = "citeseer.ist.psu.edu/article/gupta01provisioning.html" }
Citations (may not include all citations):356 Computers and Intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
333 Geometric algorithms and combinatorial optimization (context) - Grotschel, Lovasz et al. - 1988
301 Improved combinatorial algorithms for the facility location .. - Charikar, Guha - 1999 ACM DBLP
270 level uncapacitated facility location problem (context) - Aardal, Chudak et al. - 1999
194 Hierarchical placement and network design problems - Guha, Meyerson et al. - 2000 ACM DBLP
148 Approximation algorithms for facility location problems - Shmoys, Tardos et al. - 1997 ACM DBLP
86 Primal-dual approximation algorithms for metric facility loc.. - Jain, Vazirani - 1999
67 A flexible model for resource management in virtual private .. - Duffield, Goyal et al. - 1999 ACM DBLP
54 MPLS: Technology and Applications (context) - Davie, Rekhter - 2000
50 approximations with minimum packing constraint violation (context) - Lin, Vitter - 1992 ACM
49 Improved Steiner tree approximation in graphs - Robins, Zelikovsky - 2000
46 Improved approximation algorithms for network design problem.. - Goemans, Goldberg et al. - 1994 ACM DBLP
44 Approximation algorithms for geometric median problems - Lin, Vitter - 1992 ACM DBLP
37 A factor 2 approximation algorithm for the generalized Stein.. - Jain - 1998 ACM DBLP
36 Buy-at-bulk network design - Awerbuch, Azar - 1997 ACM DBLP
27 Buy-at-bulk network design: Approximating the single-sink ed.. (context) - Salman, Cheriyan et al. - 1997 DBLP
26 Building Steiner trees with incomplete global knowledge (context) - Karger, Minkoff - 2000 ACM DBLP
20 ATM virtual private networks (context) - Fotedar, Gerla et al. - 1995 ACM DBLP
17 The access network design problem - Andrews, Zhang - 1998
9 Virtual Private Networks (context) - Scott, Wolfe et al. - 1998 ACM
7 Approximating the tree and tour covers of a graph - Arkin, Halldorsson et al. - 1993 ACM DBLP
6 North-Holland Publishing Co (context) - Lovasz, Plummer - 1986
2 Approximation Algorithms for a Class of Graph Problems (context) - Williamson - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cornell.edu/home/kleinber/kleinber.html): More
The Syntenic Diameter Of The Space Of N-Chromosome Genomes - Kleinberg, Liben-Nowell (2000) (Correct)
Adversarial Queuing Theory - Borodin, Kleinberg, Raghavan, Sudan, .. (2000) (Correct)
Query Strategies for Priced Information (Extended Abstract) - Charikar, al. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC