Steiner's problem in graphs: heuristic methods

Publisher Website

1 November 1992

journal article
Published by Elsevier in Discrete Applied Mathematics

Vol. 40 (1), 45-72
https://doi.org/10.1016/0166-218x(92)90021-2

Abstract

No abstract available

Keywords

This publication has 20 references indexed in Scilit:

Path-distance heuristics for the Steiner problem in undirected networks
Algorithmica, 1992
Reduction tests for the steiner problem in grapsh
Networks, 1989
An SST‐based algorithm for the steiner problem in graphs
Networks, 1989
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters, 1988
Steiner problem in networks: A survey
Networks, 1987
Problem reduction methods and a tree generation algorithm for the steiner network problem
Networks, 1987
On finding steiner vertices
Networks, 1986
An algorithm for the steiner problem in graphs
Networks, 1984
The computation of nearly minimal Steiner trees in graphs
International Journal of Mathematical Education in Science and Technology, 1983
An integer linear programming approach to the steiner problem in graphs
Networks, 1980

Cited by 98 articles