The complexity of the network design problem
Work
Year: 1978
Type: article
Abstract: In the network design problem we are given a weighted undirected graph. We wish to find a subgraph which connects all the original vertices and minimizes the sum of the shortest path weights between ... more
Source: Networks
Institution Erasmus University Rotterdam
Cites: 12
Cited by: 395
Related to: 10
FWCI: 3.555
Citation percentile (by year/subfield): 99.53
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green