Back to search
The complexity of designing a network with minimum diameter
Data up to Jan 2025
Published1981
Citations55
References7
Total Citations Per Year
Abstract
References (7)
Some simplified NP-complete graph problems
1976 • 2,051 citations
P-Complete Approximation Problems
1976 • 1,701 citations
The Rectilinear Steiner Tree Problem is $NP$-Complete
1977 • 1,115 citations
On the Computational Complexity of Combinatorial Problems
1975 • 683 citations
Finding Minimum Spanning Trees
1976 • 425 citations
The complexity of the network design problem
1978 • 393 citations
On p-Centers in Networks
1978 • 66 citations
Cited By (0)
Loading...