中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 计算机科学国家重点实验室  > 会议论文
题名:
approximation and hardness results for label cut and related problems
作者: Zhang Peng ; Cai Jin-Yi ; Tang Linqing ; Zhao Wenbo
会议文集: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议名称: 6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009
会议日期: 43969
出版日期: 2009
会议地点: Changsha, China
关键词: Approximation algorithms ; Combinatorial optimization ; Computational complexity ; Graph theory ; Hardness
出版地: Germany
ISSN: 3029743
ISBN: 9783642020162
部门归属: (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
主办者: South Central University
英文摘要: 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.
语种: 英语
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8462
Appears in Collections:计算机科学国家重点实验室 _会议论文

Files in This Item:

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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zhang Peng]'s Articles
[Cai Jin-Yi]'s Articles
[Tang Linqing]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zhang Peng]‘s Articles
[Cai Jin-Yi]‘s Articles
[Tang Linqing]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace