A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem

Details A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem

2010-04-08

arxiv.org/abs/1004.1437v2

Computer Science

Data Structures and Algorithms

Scientific paper

The primal-dual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2-1/(n-1))-approximation for the Prize-Collecting Steiner Tree Problem that runs in O(n^3 log n) time. it applies the primal-dual scheme once for each of the n vertices of the graph. Johnson, Minkoff and Phillips proposed a faster implementation of Goemans and Williamson's algorithm. We give a proof that the approximation ratio of this implementation is exactly 2.

Affiliated with

Also associated with

No associations

Rating

A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-220403