Abstract
Given a connected graph G = (V,E) with a nonnegative cost on each edge in E, a nonnegative prize at each vertex in V, and a target set V′ ⊆ V, the Prize Collecting Steiner Tree (PCST) problem is to find a tree T in G interconnecting all vertices of V′ such that the total cost on edges in T minus the total prize at vertices in T is minimized. The PCST problem appears frequently in practice of operations research. While the problem is NP-hard in general, it is polynomial-time solvable when graphs G are restricted to series-parallel graphs.
In this paper, we study the PCST problem with interval costs and prizes, where edge e could be included in T by paying cost x e ∈ [c − e , c + e ] while taking risk (c + e − x e )/(c + e − c − e ) of malfunction at e, and vertex v could be asked for giving a prize y v ∈ [p − v , p + v ] for its inclusion in T while taking risk (y v − p − v )/(p + v − p − v ) of refusal by v. We establish two risk models for the PCST problem with interval data. Under given budget upper bound on constructing tree T, one model aims at minimizing the maximum risk over edges and vertices in T and the other aims at minimizing the sum of risks over edges and vertices in T. We propose strongly polynomial-time algorithms solving these problems on series-parallel graphs to optimality. Our study shows that the risk models proposed have advantages over the existing robust optimization model, which often yields NP-hard problems even if the original optimization problems are polynomial-time solvable.
Similar content being viewed by others
References
Aissi, H., Bazgan, C., Vanderpooten, D. Min-max (regret) versions of cut problems. Lecture Notes in Computer Science, 3827: 789–798 (2005)
Álvarez-Miranda, E., Candia, A., Chen, X., Hu, X., Li, B. Efficient algorithms for the prize collecting Steiner tree problems with interval data. Lecture Notes in Computer Science, 6124: 13–24 (2010)
Aron, I.D., Hentenryck, P.V. On the complexity of the robust spanning tree problem with interval data. Operations Research Letters, 32: 36–40 (2004)
Averbakh, I., Lebedev, V. Interval data min-max regret network optimization problems. Discrete Applied Mathematics, 138: 289–301 (2004)
Bailly-Bechet, M., Borgs, C., Braunstein, A., Chayes, J., Dagkessamanskaia, A., Franois, J.-M., Zecchina, R. Finding undetected protein associations in cell signaling by belief propagation. Proceedings of the National Academy of Sciences, 108: 882–887 (2011)
Bailly-Bechet, M., Braunstein, A., Zecchina, R. A prize-collecting steiner tree approach for transduction network inference. Lecture Notes in Computer Science, 5688: 83–95 (2009)
Beltran, H.F., Skorin-Kapov, D. On minimum cost isolated failure immune networks. Telecommunication Systems, 3: 183–200 (1994)
Bertsimas, D., Sim, M. Robust discrete optimization and network flows. Mathematical Programming Series B, 98: 49–71 (2003)
Bienstock, D., Goemans, M. X., Simchi-Levi, D., Williamson, D. A note on the prize collecting traveling salesman problem. Mathematical Programming 59: 413–420 (1993)
Chanas, S., Zieliński, P. The computational complexity of the criticality problems in a network with interval activity times. European Journal of Operational Research, 136: 541–550 (2001)
Chen, G., Xue, G. A PTAS for weight constrained Steiner trees in series parallel graphs. Theoretical Computer Science, 304: 237–247 (2003)
Chen, X., Hu, J., Hu, X. A polynomial solvable minimum risk spanning tree problem with interval data. European Journal Operational Research, 198: 43–46 (2009)
Dittrich, M., Klau, G., Rosenwald, A., Dandekar, T., Muller, T. Indentifying functional modules in proteinprotein interaction networks: an integrated exact approach. ISMB Conference Proceedings, 24: 223–231 (2008)
Feofiloff, P., Fernandes, C.G., Ferreira, C.E., Pina, J.C. Primal-dual approximation algorithms for the prize collecting Steiner tree problem. Information Processing Letters, 103: 195–202 (2007)
Grötschel, M., Monma, C.LL., Stoer, M. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research, 40: 309–330 (1992)
Hu, J. Minimizing maximum risk for fair network connection with interval data. Acta Mathematicae Applicatae Sinica (English Series), 26: 33–40 (2010)
Hwang, F.K., Richards, D.S., Winter, P. The Steiner minimum tree problems. North-Holland, Amsterdam, 1992
Johnson, D., Minkoff, M., Phillips, S. The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, 760–769
Karp, R.M. Reducibility among combinatorial problems. In: Complexity of Computer Computations, eds. by R.E. Miller and J.W. Tatcher, Plenum, New York, 1972
Kasperski, A., Zieliński P. The robust shortest path problem in series-parallel multidigraphs with interval data. Operations Research Letters, 34: 69–76 (2006)
Kasperski, A., Zieliński P. Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights. European Journal of Operational Research, 200: 680–687 (2010)
Ljubić, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M. An algorithmic framework for the exact solution of the prize-collecting steiner tree problem. Mathematical Programming B, 105: 427–449 (2006)
Lucena, A., Resende, M.G.C. Strong lower bounds for the prize collecting Steiner tree problem in graphs. Discrete Applied Mathematics, 141: 277–294 (2004)
Megiddo, N. Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4: 414–424 (1979)
Monma, C.L., Shallcross, D.F. Methods for designing communications networks with certain two-connected survivability constraints. Operations Research, 37: 531–541 (1989)
Panos, K., Gang, Y. Robust discrete optimization and its applications. 1st ed., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997
Prodon, A., DeNegre, S., Liebling, T.M. Locating leak detecting sensors in a water distribution network by solving prize-collecting steiner arborescence problems. Mathematical Programming B, 124: 119–141 (2010)
Raghavan, S. Low-connectivity network design on series-parallel graphs. Networks, 43: 163–176 (2004)
Ruzika, S., Sperber, S., Steiner, M. Earliest arrival flows on series-parallel graphs. Networks, 57: 169–173 (2011)
Wald, J.A., Colbourn, C.J. Steiner trees, partial 2-trees, and minimum IFI networks. Networks, 13: 159–167 (1983)
Wang, J.-B., Ng, C.T., Cheng, T.C.E. Single-machine scheduling with deteriorating jobs under a seriesparallel graph constraint. Computers & Operations Research, 35: 2684–2693 (2008)
Yen, C.-C., Lee, R.C.T. A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs. European Journal Operational Research, 73: 192–198 (1994)
Zielinski, P. The computational complexity of the relative robust shortest path problem with interval data. European Journal Operational Research, 158: 570–576 (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in part by the National Natural Science Foundation of China under Grant No. 11021161 and 10928102, 973 Program of China under Grant No. 2011CB80800, Chinese Academy of Sciences under Grant No. kjcx-yw-s7, project grant of “Center for Research and Applications in Plasma Physics and Pulsed Power Technology, PBCT-Chile-ACT 26” and Dirección de Programas de Investigación, Universidad de Talca, Chile.
Rights and permissions
About this article
Cite this article
Álvarez-Miranda, E., Candia-Véjar, A., Chen, Xj. et al. Risk models for the Prize Collecting Steiner Tree problems with interval data. Acta Math. Appl. Sin. Engl. Ser. 30, 1–26 (2014). https://doi.org/10.1007/s10255-014-0269-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-014-0269-z
Keywords
- uncertainty modeling
- prize collecting Steiner tree
- interval data
- series-parallel graphs
- polynomial-time solvability