BibTeX
@MISC{Minkoff00theprize,
author = {Maria Minkoff},
title = {The Prize Collecting Steiner Tree Problem},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This work is motivated by an application in local access network design that can be modeled using the NP-hard Prize Collecting Steiner Tree problem. We consider several variants on this problem and on the primal-dual 2-approximation algorithm devised for it by Goemans and Williamson. We develop several modifications to the algorithm which lead to theoretical as well as practical improvements in the performance of the algorithm for the original problem. We also demonstrate how already existing algorithms can be extended to solve the bicriteria variants of the problem with constant factor approximation guarantees. Our work leads to practical heuristics applicable in network design.
