Premium
Degree‐five Steiner points cannot reduce network costs for planar sets
Author(s) -
Rubinstein J. H.,
Thomas D. A.,
Weng J. F.
Publication year - 1992
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230220604
Subject(s) - degree (music) , combinatorics , planar , steiner tree problem , mathematics , computer science , discrete mathematics , physics , computer graphics (images) , acoustics
Abstract We show that a degree‐five Steiner point can never appear in a least‐cost planar network; that is we show that a degree‐five Steiner point actally increases the cost.