Approximation algorithm for stochastic prize-collecting Steiner tree problem

DOI10.1007/978-3-030-27195-4_24MaRDI QIDQ6199022zbMATH OpenFDO

Authors

Publication date 23 February 2024

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationapproximation algoritorithmstochastic prize-collecting Steiner tree

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
• Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
• A 2-approximation for the \(k\)-prize-collecting Steiner tree problem
• Automata, Languages and Programming
• A 2-approximation for the \(k\)-prize-collecting Steiner tree problem

This page was built for publication: Approximation algorithm for stochastic prize-collecting Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199022)