Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs

Published:2007 Issue:1 Volume:51 Page:78-89
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Apollonio N.,Lari I.,Ricca F.,Simeone B.,Puerto J.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference19 articles.

1. , , , , “Partitioning a tree into single-center subtrees to minimize flat service costs”, Technical Report, Universidad de Sevilla Dep. to de Estadistíca e Investigación Operativa, (in preparation).

2. A short note on graph tree partition problems with assignment or communication objective functions, Internal Report DEI 2001.7 ( 2001), Politecnico di Milano.

3. Combinatorial Optimization. Packing and Covering, SIAM, CBMS-NSF, Philadelphia, 2001.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel Power System Restoration;INFORMS Journal on Computing;2023-01

2. An overview of graph covering and partitioning;Discrete Mathematics;2022-08

3. Partitioning a Graph Constraining the Weight of its Cuts;SSRN Electronic Journal;2022

4. Balanced Clustering with a Tree over Clusters;Journal of Communications Technology and Electronics;2021-12

5. On finding connected balanced partitions of trees;Discrete Applied Mathematics;2021-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP