Highly Influenced

# Solving the Prize-Collecting Steiner Tree Problem to Optimality

@inproceedings{Ljubic2005SolvingTP, title={Solving the Prize-Collecting Steiner Tree Problem to Optimality}, author={Ivana Ljubic and Ren{\'e} Weiskircher and Ulrich Pferschy and Gunnar W. Klau and Petra Mutzel and Matteo Fischetti}, booktitle={ALENEX/ANALCO}, year={2005} }

- Published 2005 in ALENEX/ANALCO

The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total profit of all vertices not contained in the subtree. PCST appears in the design of utility networks (eg. fiber optics or district heating) where profit generating customers and the network connecting them have to be chosen in the most profitable way. The primary focus of this paper is the construction of… CONTINUE READING

Highly Cited

This paper has 47 citations. REVIEW CITATIONS