Join Our Newsletter

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

TAMC

2009

Springer

2009

Springer

We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classiﬁed into diﬀerent categories, represented by a set of labels. The labels may also have weights. We want to pick a subset of labels of minimum cardinality (or minimum total weight), such that the removal of all edges with these labels disconnects s and t. We give the ﬁrst non-trivial approximation and hardness results for the Label Cut problem. Firstly, we present an O( √ m)-approximation algorithm for the Label Cut problem, where m is the number of edges in the input graph. Secondly, we show that it is NP-hard to approximate Label Cut within 2log1−1/ log logc n n for any constant c < 1/2, where n is the input length of the problem. Thirdly, our techniques can be applied to other previously considered optimization problems. In particular we show that the Minimum Label Path problem has the same approximation ...

Related Content

Added |
27 May 2010 |

Updated |
27 May 2010 |

Type |
Conference |

Year |
2009 |

Where |
TAMC |

Authors |
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao |

Comments (0)