The complexity of the network design problem

Networks

Volumn 8, Issue 4, 1978, Pages 279-285

  Johnson, D S ^a   Lenstra, J K ^b   Kan, A H G Rinnooy ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b CWI   (Netherlands)

^c ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84986976912     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230080402     Document Type: Article

References (10)

1. Exact and Approximate Algorithms for Optimal Network Design
2. Strong NP‐Completeness Results: Motivation, Examples and Implications
3. Optimum Communication Spanning Trees
4. Constructing Optimal Binary Decision Trees is NP‐Complete
5. Reducibility Among Combinatorial Problems
6. On the Computational Complexity of Combinatorial Problems
7. The Optimal Network Problem: Some Computational Procedures