Approximating Steiner Networks with Node-Weights
Work
Year: 2010
Type: article
Abstract: The (undirected) Steiner Network problem is as follows: given a graph $G=(V,E)$ with edge/node-weights and edge-connectivity requirements $\{r(u,v):u,v\in U\subseteq V\}$, find a minimum-weight subgra... more
Source: SIAM Journal on Computing
Author Zeev Nutov
Cites: 14
Cited by: 50
Related to: 10
FWCI: 5.013
Citation percentile (by year/subfield): 92.27
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green