A 2-approximation for the \(k\)-prize-collecting Steiner tree problem

DOI10.1007/978-3-030-61792-9_7OpenAlexW3111415871MaRDI QIDQ5918502

Lehilton L. C. Pedrosa, Hugo K. K. Rosado

Publication date: 13 October 2022

Published in: LATIN 2020: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.09221

zbMATH Keywords

approximation algorithmprimal-dual\(k\)-MSTprize-collecting Steiner tree\(k\)-prize-collecting Steiner tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

This page was built for publication: A 2-approximation for the \(k\)-prize-collecting Steiner tree problem