The VPN Conjecture is True

N. Goyal; N.K. Olver; F.B. Shepherd

doi:10.1145/2487241.2487243

The VPN Conjecture is True

N. Goyal
, N.K. Olver
, F.B. Shepherd

Amsterdam Business Research Institute

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

We consider the following network design problem. We are given an undirected graph G = (V,E) with edge costs c(e) and a set of terminal nodes W ⊆ V. A hose demand matrix is any symmetric matrix D, indexed by the terminals, such that for each i ∈ W, Σ

Original language	English
Article number	17
Journal	Journal of the Association for Computing Machinery
Volume	60
Issue number	3
DOIs	https://doi.org/10.1145/2487241.2487243
Publication status	Published - 2013

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Access to Document

10.1145/2487241.2487243

Persistent URL (handle)

Persistent link

Cite this

@article{917579984adf4bb5a838044eed62d571,

title = "The VPN Conjecture is True",

abstract = "We consider the following network design problem. We are given an undirected graph G = (V,E) with edge costs c(e) and a set of terminal nodes W ⊆ V. A hose demand matrix is any symmetric matrix D, indexed by the terminals, such that for each i ∈ W, Σ",

author = "N. Goyal and N.K. Olver and F.B. Shepherd",

year = "2013",

doi = "10.1145/2487241.2487243",

language = "English",

volume = "60",

journal = "Journal of the Association for Computing Machinery",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - The VPN Conjecture is True

AU - Goyal, N.

AU - Olver, N.K.

AU - Shepherd, F.B.

PY - 2013

Y1 - 2013

N2 - We consider the following network design problem. We are given an undirected graph G = (V,E) with edge costs c(e) and a set of terminal nodes W ⊆ V. A hose demand matrix is any symmetric matrix D, indexed by the terminals, such that for each i ∈ W, Σ

AB - We consider the following network design problem. We are given an undirected graph G = (V,E) with edge costs c(e) and a set of terminal nodes W ⊆ V. A hose demand matrix is any symmetric matrix D, indexed by the terminals, such that for each i ∈ W, Σ

U2 - 10.1145/2487241.2487243

DO - 10.1145/2487241.2487243

M3 - Article

SN - 0004-5411

VL - 60

JO - Journal of the Association for Computing Machinery

JF - Journal of the Association for Computing Machinery

IS - 3

M1 - 17

ER -

The VPN Conjecture is True

Abstract

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this