The VPN conjecture is true Export

@inproceedings{goyal-etal-stoc08, abstract = {We consider the following network design problem. We are given an undirected graph G=(V,E) with edges costs c(e) and a set of terminal nodes W. A hose demand matrix for W is any symmetric matrix [D ij ] such that for each i, ∑ j ≠ i D ij ≤ 1. We must compute the minimum cost edge capacities that are able to support the oblivious routing of every hose matrix in the network.}, address = {New York, NY, USA}, author = {Goyal, Navin and Olver, Neil and Shepherd, F. B.}, booktitle = {STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing}, citeulike-article-id = {3196604}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1374376.1374440}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1374376.1374440}, doi = {10.1145/1374376.1374440}, isbn = {978-1-60558-047-0}, keywords = {oblivious, routing}, location = {Victoria, British Columbia, Canada}, pages = {443--450}, posted-at = {2008-09-05 03:19:00}, priority = {2}, publisher = {ACM}, title = {The VPN conjecture is true}, url = {http://dx.doi.org/10.1145/1374376.1374440}, year = {2008} }

TY - CONF ID - goyal-etal-stoc08 L3 - citeulike-article-id:3196604 N2 - We consider the following network design problem. We are given an undirected graph G=(V,E) with edges costs c(e) and a set of terminal nodes W. A hose demand matrix for W is any symmetric matrix [D ij ] such that for each i, ∑ j ≠ i D ij ≤ 1. We must compute the minimum cost edge capacities that are able to support the oblivious routing of every hose matrix in the network. CY - Victoria, British Columbia, Canada SN - 978-1-60558-047-0 AD - New York, NY, USA EP - 450 TI - The VPN conjecture is true PB - ACM T2 - STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing SP - 443 KW - oblivious KW - routing AU - Goyal, Navin AU - Olver, Neil AU - Shepherd, FB PY - 2008/// UR - http://dx.doi.org/10.1145/1374376.1374440 ER -