Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
From MaRDI portal
Publication:3578355
DOI10.1007/978-3-642-14355-7_3zbMath1286.90154OpenAlexW1928638915MaRDI QIDQ3578355
Eduardo Álvarez-Miranda, Xiao-Dong Hu, Alfredo Candia, Bi Li, Xu-jin Chen
Publication date: 20 July 2010
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14355-7_3
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Risk models for the prize collecting Steiner tree problems with interval data ⋮ Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree ⋮ Exact approaches for solving robust prize-collecting Steiner tree problems
This page was built for publication: Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data