No CrossRef data available.
Article contents
An approximation algorithm for the
$\boldsymbol{K}$-prize-collecting multicut problem in trees with submodular penalties
Published online by Cambridge University Press: 17 April 2024
Abstract
Let $T=(V,E)$ be a tree in which each edge is assigned a cost; let
$\mathcal{P}$ be a set of source–sink pairs of vertices in V in which each source–sink pair produces a profit. Given a lower bound K for the profit, the K-prize-collecting multicut problem in trees with submodular penalties is to determine a partial multicut
$M\subseteq E$ such that the total profit of the disconnected pairs after removing M from T is at least K, and the total cost of edges in M plus the penalty of the set of still-connected pairs is minimized, where the penalty is determined by a nondecreasing submodular function. Based on the primal-dual scheme, we present a combinatorial polynomial-time algorithm by carefully increasing the penalty. In the theoretical analysis, we prove that the approximation factor of the proposed algorithm is
$(\frac{8}{3}+\frac{4}{3}\kappa+\varepsilon)$, where
$\kappa$ is the total curvature of the submodular function and
$\varepsilon$ is any fixed positive number. Experiments reveal that the objective value of the solutions generated by the proposed algorithm is less than 130% compared with that of the optimal value in most cases.
Keywords
- Type
- Special Issue: TAMC 2022
- Information
- Mathematical Structures in Computer Science , Volume 34 , Special Issue 3: Theory and Applications of Models of Computation , March 2024 , pp. 193 - 210
- Copyright
- © The Author(s), 2024. Published by Cambridge University Press
Footnotes
A preliminary version of this paper appeared in the Proceedings of the 17th Annual Conference on Theory and Applications of Models of Computation, pp. 262–271, 2022.
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240531081726252-0437:S0960129524000124:S0960129524000124_inline474.png?pub-status=live)