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

JCO

2007

2007

Let G = (V, E) be a connected multigraph, whose edges are associated with labels speciﬁed by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-negative cost c(ℓ). The minimum label spanning tree problem (MinLST) asks to ﬁnd a spanning tree in G that minimizes the overall cost of the labels used by its edges. Equivalently, we aim at ﬁnding a minimum cost subset of labels I ⊆ N such that the edge set {e ∈ E : L(e) ∈ I} forms a connected subgraph spanning all vertices. Similarly, in the minimum label s-t path problem (MinLP) the goal is to identify an s-t path minimizing the combined cost of its labels. The main contributions of this paper are improved approximation algorithms and hardness results for MinLST and MinLP.

Related Content

Added |
15 Dec 2010 |

Updated |
15 Dec 2010 |

Type |
Journal |

Year |
2007 |

Where |
JCO |

Authors |
Refael Hassin, Jérôme Monnot, Danny Segev |

Comments (0)