The complexity of the network design problem

This publication has 9 references indexed in Scilit:

• Exact and approximate algorithms for optimal network design
  Networks, 1979
• `` Strong '' NP-Completeness Results
  Journal of the ACM, 1978
• Constructing optimal binary decision trees is NP-complete
  Information Processing Letters, 1976
• Some NP-complete geometric problems
  Published by Association for Computing Machinery (ACM) ,1976
• On the Computational Complexity of Combinatorial Problems
  Networks, 1975
• Optimum Communication Spanning Trees
  SIAM Journal on Computing, 1974
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• The optimal network problem: Some computational procedures
  Transportation Research, 1969
• Applied Dynamic Programming
  Published by Walter de Gruyter GmbH ,1962