A heuristic for the Steiner problem in graphs

Computational Optimization and Applications

Volumn 6, Issue 1, 1996, Pages 5-14

  Khoury, B N ^a   Pardalos, P M ^a  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

Heuristics; Minimum spanning tree; Steiner problem; Testing

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; SET THEORY;

MINIMUM SPANNING TREE; PRIM ALGORITHM; STEINER PROBLEM;

HEURISTIC METHODS;

EID: 0030190482     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00248006     Document Type: Article

References (20)

1. J.E. Beasley, "OR-Library: Distributing test problems by electronic mail," J. of Oper. Res. Soc., vol. 41, no. 11, pp. 1069-1072, 1990.
2. J.E. Beasley, "A heuristic for Euclidean and rectilinear Steiner problems," Europ. J. of Oper. Res., vol. 58, pp. 284-292, 1992.
3. D.-Z. Du, "Approximating the Steiner minimum tree," in Complexity in Numerical Optimization (P.M. Pardalos Ed.), World Scientific, pp. 88-106, 1993.
4. S.L. Hakimi, "Steiner's problem in graphs and its implications," Networks, vol. 1, pp. 113-133, 1971.
5. F.K. Hwang, "On Steiner minimal trees with rectilinear distance," SIAM J. Appl. Math., vol. 30, pp. 104-114, 1976.
6. F.K. Hwang and D.S. Richards, "Steiner tree problems," Networks, vol. 2, pp. 55-89, 1992.
7. F.K. Hwang, D.S. Richards, and P. Winter, The Steiner Tree Problem, Elsevier: Amsterdam, 1992.
8. R.M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Communications (R.E. Miller and J.W. Tatcher, Eds.), pp. 85-103, Plenum Press: New York, 1972.
9. B.N. Khoury, P.M. Pardalos, and D.-Z. Du, "A test problem generator for the Steiner problem in graphs," ACM Transactions on Mathematical Software, vol. 19, no. 4, pp. 509-522, 1993.
10. B.N. Khoury, P.M. Pardalos, and D.W. Hearn, "Equivalent formulations for the Steiner problem in graphs," in Network Optimization Problems (P.M. Pardalos and D.-Z. Du Eds.), World Scientific, pp. 111-124, 1993.
11. B.N. Khoury and P.M. Pardalos, "An exact branch and bound algorithm for the Steiner problem in graphs," in Proceedings of COCOON'95, Springer-Verlag, Lecture Notes in Computer Science (D. Du and M. Li Eds.), vol. 959, pp. 582-590, 1995.
12. A. Ju Levin, "Algorithms for the shortest connection of a group of graph vertices," Soviet Math. Doklady vol. 12, pp. 1477-1481, 1971.
13. V.J. Rayward-Smith and A. Clare, "On finding Steiner vertices," Networks, vol. 16, pp. 283-294, 1986.
14. J. MacGregor Smith and P. Winter (Eds.), Topological Network Design, vol. 31, nos. 1-4 of Annals of Operations Research, 1991.
15. J. Soukup and W.F. Chow, "Set of test problems for the minimum length connection networks," ACM/SIGMAP Newsletter, vol. 15, pp. 48-51, 1973.
16. H. Takahashi and A. Mutsuyama, "An approximate solution for the Steiner problem in graphs," Math. Jpn., vol. 24, pp. 573-477, 1980.
17. S. Voss, Steiner-Probleme in Graphen, (in German), Hain, Frankfurt, 1990.
18. S. Voss, "Steiner's problem in graphs: Heuristic methods," Discrete Applied Mathematics, vol. 40, pp. 45-72, 1992.
19. P. Winter, "Steiner problem in networks: A survey," Networks, vol. 17, pp. 129-167, 1987.
20. P. Winter and J. MacGregor Smith, "Path-distance heuristics for the Steiner problem in undirected networks," Algorithmica, vol. 7, pp. 309-328, 1992.