期刊名称：Relatórios de Pesquisa em Engenharia de Produção
电子版ISSN：1678-2399
出版年度：2004
卷号：4
出版社：Universidade Federal Fluminense (UFF)
摘要：The Prize-Collecting Steiner Problem (PCSP) is a generalization of the classical SteinerProblem in Graphs (SPG) where instead of terminal vertices that must be necessarily connected,one have profits associated to the vertices that must be balanced against the connection costs.This problem is gaining much attention in the last years due to its practical applications onnetwork design. This article introduces a proper redefinition of the concept of bottleneck Steinerdistance on the PCSP context. This allows the application of known STP reduction tests onthe PCSP in their full power
