版权说明 操作指南
首页 > 成果 > 详情

Parameterized minimum cost partition of a tree with supply and demand

认领
导出
Link by 万方会议论文
反馈
分享
QQ微信 微博
成果类型:
期刊论文、会议论文
作者:
Lin, Mugang*;Li, Wenjun;Feng, Qilong
通讯作者:
Lin, Mugang
作者机构:
[Feng, Qilong; Li, Wenjun; Lin, Mugang] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.
[Lin, Mugang] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.
通讯机构:
[Lin, Mugang] C
Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.
语种:
英文
关键词:
Algorithms;Economics;Forestry;Minimum cost;Parameterized;Parameterized algorithm;Partition problem;Reduction rules;Running time;Supply and demand;Costs
期刊:
Lecture Notes in Computer Science
ISSN:
0302-9743
年:
2015
卷:
9130
页码:
180-189
会议名称:
International Frontiers of Algorithmics Workshop
会议论文集名称:
Frontiers in algorithmics: 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings
会议时间:
20150703-05
会议地点:
Guilin
会议主办单位:
[Lin, Mugang;Li, Wenjun;Feng, Qilong] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.^[Lin, Mugang] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.
主编:
Jianxin Wang<&wdkj&>Chee Yap
出版地:
HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者:
Springer Verlag
ISBN:
9783319196466
基金类别:
This work is supported by the National Natural Science Foundation of China under Grants (61232001, 61472449, 61420106009, 61402054), and the Hengyang Foundation for Development of Science and Technology under Grant(2014KJ21).
机构署名:
本校为其他机构
院系归属:
计算机科学与技术学院
摘要:
In this paper, we study the minimum cost partition problem of a tree with supply and demand. For the kernelizaton of the problem, several reduction rules are given, which result in a kernel of size O(k2) for the problem. Based on the branching technique, a parameterized algorithm of running time O* (2.828k) is presented. © Springer In...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

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

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com