The complexity of the network design problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (12)
Reducibility among Combinatorial Problems
1972 • 10,743 citations
Applied Dynamic Programming.
1964 • 2,240 citations
Applied Dynamic Programming
1962 • 1,878 citations
Constructing optimal binary decision trees is NP-complete
1976 • 940 citations
On the Computational Complexity of Combinatorial Problems
1975 • 683 citations
`` Strong '' NP-Completeness Results
1978 • 624 citations
Some NP-complete geometric problems
1976 • 400 citations
Optimum Communication Spanning Trees
1974 • 269 citations
An assignment routing problem
1979 • 152 citations
Exact and approximate algorithms for optimal network design
1979 • 98 citations
The optimal network problem: Some computational procedures
1969 • 63 citations
A Survey of Network Design Problems
1976 • 11 citations