首页> 美国政府科技报告 >Cost of Sequential Connection for Points in Space.
【24h】

Cost of Sequential Connection for Points in Space.

机译:空间点的顺序连接成本。

获取原文

摘要

A bound is given for the cost of the spanning tree produced by the sequential minimal insertion procedure as applied to n points in the unit d-cube. The technique developed is reasonably general and can be applied to several other problems of computational geometry, including the nearest neighbor heuristic for the traveling salesman problem. Attention is also given to bounding the sum of the powers of the edge lengths of sequentially constructed trees and paths. Examples illustrate that the bounds obtained are of best possible order as a function of the number of points. Keywords: Reprints. (kr)

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号