首页> 外文会议>Algorithms and Computation; Lecture Notes in Computer Science; 4288 >Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
【24h】

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees

机译:树中路径/树形设施位置问题的最佳算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper we consider the problem of locating a path-shaped or tree-shaped (extensive) facility in trees under the condition that existing facilities are already located. We introduce a parametric-pruning method to solve the conditional extensive weighted 1-center location problems in trees in linear time. This improves the recent results of O(n log n) by Tamir et al.
机译:在本文中,我们考虑在现有设施已经定位的情况下在树中放置路径形或树形(扩展)设施的问题。我们引入了一种参数修剪方法,以解决线性时间内树木中条件广泛的加权一中心定位问题。这改善了Tamir等人最近的O(n log n)结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号