Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data

2010 ◽  
pp. 13-24 ◽  
Author(s):  
E. Álvarez-Miranda ◽  
A. Candia ◽  
X. Chen ◽  
X. Hu ◽  
B. Li
Keyword(s):  
Steiner Tree ◽  
Interval Data ◽  
Efficient Algorithms ◽  
Steiner Tree Problems ◽  
Prize Collecting

Risk models for the Prize Collecting Steiner Tree problems with interval data

2014 ◽  
Vol 30 (1) ◽  
pp. 1-26 ◽  
Author(s):  
Eduardo Álvarez-Miranda ◽  
Alfredo Candia-Véjar ◽  
Xu-jin Chen ◽  
Xiao-dong Hu ◽  
Bi Li
Keyword(s):  
Steiner Tree ◽  
Interval Data ◽  
Risk Models ◽  
Steiner Tree Problems ◽  
Prize Collecting

scholarly journals A 4-approximation algorithm for k-prize collecting Steiner tree problems

2018 ◽  
Vol 13 (2) ◽  
pp. 341-348 ◽  
Author(s):  
Yusa Matsuda ◽  
Satoshi Takahashi
Keyword(s):  
Approximation Algorithm ◽  
Steiner Tree ◽  
Steiner Tree Problems ◽  
Prize Collecting

scholarly journals Exact approaches for solving robust prize-collecting Steiner tree problems

2013 ◽  
Vol 229 (3) ◽  
pp. 599-612 ◽  
Author(s):  
Eduardo Álvarez-Miranda ◽  
Ivana Ljubić ◽  
Paolo Toth
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problems ◽  
Prize Collecting

The role of Steiner hulls in the solution to Steiner tree problems

1991 ◽  
Vol 33 (7) ◽  
pp. 537-548 ◽  
Author(s):  
J. Scott Provan
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problems

The Fractional Prize-Collecting Steiner Tree Problem on Trees

2003 ◽  
pp. 691-702 ◽  
Author(s):  
Gunnar W. Klau ◽  
Ivana Ljubić ◽  
Petra Mutzel ◽  
Ulrich Pferschy ◽  
René Weiskircher
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Prize Collecting
Sign in / Sign up

Export Citation Format

Share Document