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 | |
Publication status | Published - 2013 |