Internet Archive Scholar

Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem

Jian Sun, Haiyun Sheng, Yuefang Sun, Donglei Du, Xiaoyan Zhang
2021 Journal of Industrial and Management Optimization  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (356.6 kB)
https://web.archive.org/web/20210709101544/https://www.aimsciences.org/article/exportPdf?id=5c8995c7-b45f-4ae9-8467-76ff8718a284

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL. The file type is application/pdf.

Steiner tree problem is a typical NP-hard problem, which has vast application background and has been an active research topic in recent years. Stochastic optimization problem is an important branch in the field of optimization. Compared with deterministic optimization problem, it is an optimization problem with random factors, and requires the use of tools such as probability and statistics, stochastic process and stochastic analysis. In this paper, we study a two-stage finite-scenario
more » ... ic prize-collecting Steiner tree problem, where the goal is to minimize the sum of the first stage cost, the expected second stage cost and the expected penalty cost. Our main contribution is to present a primal-dual 3-approximation algorithm for this problem. 2020 Mathematics Subject Classification. Primary: 90C27, 68W25.
doi:10.3934/jimo.2021116 fatcat:vlha4fkpfzfi7aqizyxup2pqse
Citation

Jian Sun, Haiyun Sheng, Yuefang Sun, Donglei Du, Xiaoyan Zhang. "Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem." Journal of Industrial and Management Optimization 0.0 (2021)