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

ISAAC

2004

Springer

2004

Springer

The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a generalization of the Steiner tree problem, so called Polymatroid Steiner Problem, in which a polymatroid P = P(V ) is deﬁned on V and the Steiner tree is required to span at least one base of P (in particular, there may be a single base S ⊆ V ). This formulation is motivated by the following application in sensor networks – given a set of sensors S = {s1, . . . , sk}, each sensor si can choose to monitor only a single target from a subset of targets Xi, ﬁnd minimum cost tree spanning a set of sensors capable of monitoring the set of all targets X = X1 ∪ . . . ∪ Xk. The Polymatroid Steiner Problem generalizes many known Steiner tree problem formulations including the group and covering Steiner tree problems. We show that this problem can be solved with the polylogarithmic approximation ratio by a genera...

Related Content

Added |
02 Jul 2010 |

Updated |
02 Jul 2010 |

Type |
Conference |

Year |
2004 |

Where |
ISAAC |

Authors |
Gruia Calinescu, Alexander Zelikovsky |

Comments (0)