Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,Computer Science Applications,Information Systems,Management Information Systems
Reference47 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
2. Gabow, H.N.: A good algorithm for smallest spanning trees with a degree constraint. Networks 8(3), 201–208 (1978)
3. Narula, S.C., Ho, C.A.: Degree constrained minimum spanning tree. Comput. Oper. Res. 7(4), 239–249 (1980)
4. Prim, R.C.: Shortest connections networks and some generalization. Bell Syst. Tech. J. 36(6), 1389–1401 (1957)
5. Gavish, B.: Topological design of centralized computer networks, formulations and algorithms. Networks 12(4), 355–377 (1982)