Algorithms for finding P-centers on a weighted tree (for relatively small P)-Reference-Cited by-同舟云学术

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

Algorithms for finding P-centers on a weighted tree (for relatively small P)

Published:1985 Issue:3 Volume:15 Page:381-389
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Jeger M.,Kariv O.

Publisher

Wiley

Subject

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

Reference15 articles.

1. A Shifting Algorithm for Min-Max Tree Partitioning

2. [Also appeared in Proc. of the 7th ICALP Noordwijkerhout (The Netherlands), July 1980, pp. 64–75 and

3. Max-Min Tree Partitioning

4. An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree

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

1. The extensive 1-median problem with radius on networks;Opuscula Mathematica;2024

2. Exact solution approaches for the discrete α‐neighbor p‐center problem;Networks;2023-06-13

3. The weighted k-center problem in trees for fixed k;Theoretical Computer Science;2022-03

4. An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees;SIAM Journal on Computing;2021-01

5. Optimal algorithms for weighted 1-center problem in deterministic and stochastic tree networks;Alexandria Engineering Journal;2020-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP