| Title: | approximation and hardness results for label cut and related problems |
| Author: | Zhang Peng
; Cai Jin-Yi
; Tang Linqing
; Zhao Wenbo
|
| Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| Conference Name: | 6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009
|
| Conference Date: | 43969
|
| Issued Date: | 2009
|
| Conference Place: | Changsha, China
|
| Keyword: | Approximation algorithms
; Combinatorial optimization
; Computational complexity
; Graph theory
; Hardness
|
| Publish Place: | Germany
|
| ISSN: | 3029743
|
| ISBN: | 9783642020162
|
| Department: | (1) School of Computer Science and Technology, Shandong University, Jinan 250101, China; (2) Computer Sciences Department, University of Wisconsin, Madison, WI 53706, United States; (3) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (4) Dept. of Computer Science and Engineering, University of California, San Diego, San Diego, CA 92093, United States
|
| Sponsorship: | South Central University
|
| English Abstract: | 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 classified into different 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 first 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 nn 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 hardness as that of Label Cut, simultaneously improving and unifying two known hardness results for this problem which were previously the best (but incomparable due to different complexity assumptions). © Springer-Verlag Berlin Heidelberg 2009. |
| Language: | 英语
|
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/8462
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
|
There are no files associated with this item.
|
| Recommended Citation: | |
Zhang Peng,Cai Jin-Yi,Tang Linqing,et al. approximation and hardness results for label cut and related problems[C]. 见:6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009. Changsha, China. 43969.
|
|
|
