Partition on trees with supply and demand: Kernelization and algorithms

首页 > 成果 > 详情

认领

导出

Link by 万方学术期刊

反馈

作者信息关键词期刊信息基础信息归属信息摘要

成果类型：

期刊论文

作者：

Lin, Mugang;Feng, Qilong*;Chen, Jianer;Li, Wenjun

通讯作者：

Feng, Qilong

作者机构：

[Feng, Qilong; Chen, Jianer; Li, Wenjun; Lin, Mugang] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.

[Lin, Mugang] Hengyang Normal Univ, Sch Comp Sci & Technol, Hengyang, Peoples R China.

[Chen, Jianer] Texas A&M Univ, Dept Comp Sci & Engn, College Stn, TX 77843 USA.

[Li, Wenjun] Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Hunan Prov Key Lab Intelligent Proc Big Data Tran, Changsha, Hunan, Peoples R China.

通讯机构：

[Feng, Qilong] C

Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.

语种：

英文

关键词：

Fixed-parameter tractability;Network reconfiguration;Kemelizaton;Branching algorithm

期刊：

Theoretical Computer Science

ISSN：

0304-3975

年：

2017

卷：

657

期：

页码：

11-19

DOI：

10.1016/j.tcs.2016.06.044

基金类别：

National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [61232001, 61472449, 61420106009, 61502054]

机构署名：

本校为其他机构

摘要：

Network reconfiguration is an important research topic in the planning and operation of power distribution networks. In this paper, we study the partition problem on trees with supply and demand from parameterized computation perspective. We analyze the relationship between supply nodes and demand nodes, and give four reduction rules, which result in a kernel of size O(k(2)) for the problem. Based on branching technique, a parameterized algorithm of running time O*...

反馈

产权有误：本人成果被他人认领

数据有误：数据基本信息有误

归属有误：成果的院系归属、机构署名归属有误

其他原因：

验证码：

看不清楚，换一个

确定

取消

成果认领

标题：

用户	作者	通讯作者	--
	请选择	请选择	--

确定

取消

Partition on trees with supply and demand: Kernelization and algorithms

反馈

成果认领

提示

该栏目需要登录且有访问权限才可以访问