The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract

@inproceedings{Klau2003TheFP,
  title={The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract},
  author={Gunnar W. Klau and Ivana Ljubic and Petra Mutzel and Ulrich Pferschy and Ren{\'e} Weiskircher},
  booktitle={ESA},
  year={2003}
}
We consider the fractional prize-collecting Steiner tree problem on trees. This problem asks for a subtree T containing the root of a given tree G = (V, E) maximizing the ratio of the vertex profits ∑ v∈V (T ) p(v) and the edge costs ∑ e∈E(T ) c(e) plus a fixed cost c0 and arises in energy supply management. We experimentally compare three algorithms based on parametric search: the binary search method, Newton’s method, and a new algorithm based on Megiddo’s parametric search method. We show… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

The fractional prize-collecting Steiner tree problem on trees

  • G. Klau, I. Ljubić, P. Mutzel, U. Pferschy, R. Weiskircher
  • Technical Report TR-186-1-03-01, Institute of…
  • 2003
Highly Influential
4 Excerpts

Explab

  • S. Hert, L. Kettner, T. Polzin, G. Schäfer
  • http://explab.sourceforge.net,
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…