Steiner's problem in graphs and its implications

@article{Hakimi1971SteinersPI,
  title={Steiner's problem in graphs and its implications},
  author={S. Louis Hakimi},
  journal={Networks},
  year={1971},
  volume={1},
  pages={113-133}
}
A graph theoretic version of Steiner's problem in plane geometry is described. An approach for solving this problem, related to Melzak's solution to Steiner's problem, is presented. The problems of finding “shortest route” and “minimal spanning tree” in graphs become special cases of the Steiner's problem in graphs. It is shown that a solution to this problem also provides us with a solution to the problems of finding a minimum externally stable set and a maximum internally stable set in a… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 202 CITATIONS

Multicast protection with differentiated leaf availability requirements in WDM mesh networks

  • SPIE/OSA/IEEE Asia Communications and Photonics
  • 2005
VIEW 13 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Geometric interconnection and placement algorithms

VIEW 23 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Steiner trees and beyond: approximation algorithms for network design

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

On traffic grooming and survivability in WDM optical networks

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1974
2019

CITATION STATISTICS

  • 17 Highly Influenced Citations

  • Averaged 6 Citations per year from 2017 through 2019