咨询与建议

限定检索结果

文献类型

  • 1 篇 会议

馆藏范围

  • 1 篇 电子文献
  • 0 种 纸本馆藏

日期分布

主题

  • 1 篇 approximation al...
  • 1 篇 ad hoc networks
  • 1 篇 computational ge...
  • 1 篇 strontium
  • 1 篇 algorithm design...
  • 1 篇 complexity theor...
  • 1 篇 approximation me...

机构

  • 1 篇 ational laborato...

作者

  • 1 篇 gaojun fan
  • 1 篇 shiyao jin

语言

  • 1 篇 英文
检索条件"机构=Ational Laboratory of Parallel and Distributed Processing"
1 条 记 录,以下是1-10 订阅
排序:
An Efficient Algorithm for the Least Areas Path Problem
An Efficient Algorithm for the Least Areas Path Problem
收藏 引用
ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM
作者: Gaojun Fan Shiyao Jin Ational Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China
The goal of the least areas path problem (LAPP) is to find a path traversing through a given region covered by a set of areas with any arbitrary shape, between a given pair of points and with the property that each po... 详细信息
来源: 评论