References
- Angel, E., and V. Zissimopoulos. 2000. “On the Classification of NP-Complete Problems in Terms of Their Correlation Coefficient.” Discrete Applied Mathematics 99 (1–3): 261–277. doi: 10.1016/S0166-218X(99)00138-9
- Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Mathematical Sciences Series. New York: W. H. Freeman.
- Gilbert, E. N., and H. O. Pollak. 1968. “Steiner Minimal Trees.” SIAM Journal on Applied Mathematics 16 (1): 1–29. doi: 10.1137/0116001
- Harary, F., and E. M. Palmer. 1973. Graphical Enumeration. New York: Academic Press. doi:10.1016/C2013-0-10826-4
- Kirzhner, V., and V. I. Rublinecky. 1974. “An Upper Limit for the Traveling Salesman Minimal Tour.” [In Russian.] Proceedings of the Low Temperature Physics Institute, Computing Mathematics & Computers 1974: 120–122.
- Kirzhner, V., Z. Volkovich, E. Ravve, and G.-W. Weber. 2016. “An Estimate of the Objective Function Optimum for the Network Steiner Problem.” Annals of Operations Research 238 (1-2): 315–328. doi:10.1007/s10479-015-2068-1
- Prim, R. C.. 1957. “Shortest Connection Networks and Some Generalizations.” Bell System Technical Journal 36 (6): 1389–1401. doi:10.1002/j.1538-7305.1957.tb01515.x
- Richter, K. 1982. Dynamische Aufgaben der diskreten Optimierung [Dynamic Tasks of Discrete Optimization]. Berlin: Akademie-Verlag.