咨询与建议

限定检索结果

文献类型

  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 信息与通信工程
    • 1 篇 计算机科学与技术...

主题

  • 1 篇 minimum spanning...
  • 1 篇 maximum coverage...
  • 1 篇 color-spanning s...
  • 1 篇 approximation al...
  • 1 篇 farthest-color v...

机构

  • 1 篇 xi an jiao tong ...
  • 1 篇 state key lab mf...

作者

  • 1 篇 wang yin
  • 1 篇 xu yinfeng

语言

  • 1 篇 英文
检索条件"主题词=Maximum coverage problems"
1 条 记 录,以下是1-10 订阅
An Approximation Algorithm for the k-Connected Location Set Cover Problem with Color-Spanning Constraint  1
收藏 引用
International-Federation-of-Information-Processing-Working-Group-5.7 (IFIP WG 5.7) International Conference on Advances in Production Management Systems (APMS)
作者: Wang, Yin Xu, Yinfeng Xi An Jiao Tong Univ Sch Management Xian 710049 Shaanxi Peoples R China State Key Lab Mfg Syst Engn Xian 710049 Shaanxi Peoples R China
Motivated by the need for a more sensitive server assignment strategy in supply-chain network management, our total cost comprises coverage area (i.e., disk) sizes and "moving" service modes that facilitate ... 详细信息
来源: 评论