• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Solving Covering Problems and the Uncapacitated Plant Location Problem on Trees
【24h】

Solving Covering Problems and the Uncapacitated Plant Location Problem on Trees

机译：解决树木覆盖问题及无树木植物定位问题

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Given a tree network on n vertices, a neighborhood subtree is defined as the set of all points on the tree within a certain radius of a given point, called the center. It is shown that for any two neighborhood subtrees containing the same endpoint of a longest path in the tree one is contained in the other. This result is then used to obtain O(n(2)) algorithms for the minimum cost covering problem and the minimum cost operating problem as well as an O(n(3)) algorithm for the uncapacitated plant location problem on the tree.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号