Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

COCOA

2008

Springer

2008

Springer

This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a collection T = {T1, . . . , Tk}, each a subset of V of size at least 2, a weight function w : E R+ , and a penalty function p : T R+ . The goal is to find a forest F that minimizes the cost of the edges of F plus the penalties paid for subsets Ti whose vertices are not all connected by F. Our main result is a combinatorial (3- 4 n )-approximation for the prize collecting generalized Steiner forest problem, where n 2 is the number of vertices in the graph. This obviously implies the same approximation for the special case called the prize collecting Steiner forest problem (all subsets Ti are of size 2). The approximation ratio we achieve is better than that of the best known combinatorial algorithm for this problem, which is the 3-approximation of Sharma, Swamy, and Williamson [13]. Furthermore, our algorithm is...

Related Content

Added |
18 Oct 2010 |

Updated |
18 Oct 2010 |

Type |
Conference |

Year |
2008 |

Where |
COCOA |

Authors |
Shai Gutner |

Comments (0)