Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Spitzley, Yannik Kyle Dustin"'
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or telecommunicat
Externí odkaz:
http://arxiv.org/abs/2305.03381
In this paper, we consider the Uniform Cost-Distance Steiner Tree Problem in metric spaces, a generalization of the well-known Steiner tree problem. Cost-distance Steiner trees minimize the sum of the total length and the weighted path lengths from a
Externí odkaz:
http://arxiv.org/abs/2211.03830