中国科学院软件研究所机构知识库
Register
Email:
Passwd
验 证:
换一张
Have you forgotten your password? Log In
Advanced  
  Communities
  Subjects
  All Items
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
approximation and hardness results for label cut and related problems
Author: Zhang Peng ; Cai Jin-Yi ; Tang Lin-Qing ; Zhao Wen-Bo
Keyword: Combinatorial optimization ; Hardness
Source: Journal of Combinatorial Optimization
Issued Date: 2011
Volume: 21, Issue:2, Pages:192-208
Indexed Type: ei
Department: (1) School of Computer Science and Technology, Shandong University, Ji'nan 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 100190, China; (4) Graduate University, Chinese Academy of Sciences, Beijing 100190, China; (5) Dept. of Computer Science and Engineering, University of California, San Diego, San Diego, CA 92093, United States
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 2log 1-1 / log log cnn 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). © 2009 Springer Science+Business Media, LLC.
Language: 英语
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/14065
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
Approximation and hardness results for label cut and related problems.pdf（528KB）----限制开放-- 联系获取全文

Recommended Citation:
Zhang Peng,Cai Jin-Yi,Tang Lin-Qing,et al. approximation and hardness results for label cut and related problems[J]. Journal of Combinatorial Optimization,2011-01-01,21(2):192-208.
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 Lin-Qing]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zhang Peng]‘s Articles
[Cai Jin-Yi]‘s Articles
[Tang Lin-Qing]‘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-2020  中国科学院软件研究所 - Feedback
Powered by CSpace