Finding connected kappa-subgraphs with high density
文献类型：期刊论文
| 作者 | Chen, Xujin1 ; Hua, Xiaodong1; Wang, Changjun2
|
| 刊名 | INFORMATION AND COMPUTATION
 |
| 出版日期 | 2017-10-01 |
| 卷号 | 256页码:160-173 |
| 关键词 | Densest kappa-subgraphs Heaviest kappa-subgraphs Connectivity Approximation algorithms Interval graphs |
| ISSN号 | 0890-5401 |
| DOI | 10.1016/j.ic.2017.07.003 |
| 英文摘要 | Given an edge-weighted connected graph G on n vertices and a positive integer k <= n, a subgraph of G on k vertices is called a k-subgraph in G. We design combinatorial approximation algorithms for finding a connected k-subgraph in G such that its weighted density is at least a factor Omega(max{1/k, k(2)/n(2)}) of the maximum weighted density among all k-subgraph in G(which are not necessarily connected), where max{1/k, k(2)/n(2)} >= n(-2/3) implies an O(n(2/3))-approximation ratio. We obtain improved O(n(2/5))-approximation for unit weights. These particularly provide the first non-trivial approximations for the heaviest/densest connected k-subgraph problem on general graphs. We also give O(root nlogn)-approximation for the problem on general weighted interval graphs. (C) 2017 Elsevier Inc. All rights reserved.k |
| 资助项目 | NNSF of China[11531014] ; NNSF of China[11601022] ; Open Fund of Beijing Institute for Scientific and Engineering Computing |
| WOS研究方向 | Computer Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000412282400014 |
| 出版者 | ACADEMIC PRESS INC ELSEVIER SCIENCE |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/26676]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | Wang, Changjun |
| 作者单位 | 1.Chinese Acad Sci, Inst Appl Math, AMSS, Beijing 100190, Peoples R China 2.Beijing Univ Technol, Beijing Inst Sci & Engn Comp, Beijing 100124, Peoples R China |
| 推荐引用方式 GB/T 7714 | Chen, Xujin,Hua, Xiaodong,Wang, Changjun. Finding connected kappa-subgraphs with high density[J]. INFORMATION AND COMPUTATION,2017,256:160-173. |
| APA | Chen, Xujin,Hua, Xiaodong,&Wang, Changjun.(2017).Finding connected kappa-subgraphs with high density.INFORMATION AND COMPUTATION,256,160-173. |
| MLA | Chen, Xujin,et al."Finding connected kappa-subgraphs with high density".INFORMATION AND COMPUTATION 256(2017):160-173. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。