An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties

DOI10.1017/s0960129524000124MaRDI QIDQ6620014

Weidong Li, Xiaofei Liu

Publication date: 16 October 2024

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmprimal-dual scheme\(K\) prize collectingmulticut problem in trees with submodular penalties

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties