咨询与建议

限定检索结果

文献类型

  • 2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 2 篇 理学
    • 2 篇 数学
  • 1 篇 工学
    • 1 篇 计算机科学与技术...

主题

  • 2 篇 parameterized co...
  • 1 篇 approximation al...
  • 1 篇 barrier resilien...
  • 1 篇 motion planning
  • 1 篇 colored path
  • 1 篇 planar graphs
  • 1 篇 barrier resilien...
  • 1 篇 minimum constrai...
  • 1 篇 barrier coverage
  • 1 篇 bounded ply
  • 1 篇 fat regions

机构

  • 1 篇 royal holloway u...
  • 1 篇 tohoku univ send...
  • 1 篇 univ politecn ca...
  • 1 篇 univ utrecht dep...
  • 1 篇 depaul univ sch ...
  • 1 篇 colgate univ dep...

作者

  • 1 篇 eiben eduard
  • 1 篇 korman matias
  • 1 篇 silveira rodrigo...
  • 1 篇 loffler maarten
  • 1 篇 strash darren
  • 1 篇 kanj iyad

语言

  • 2 篇 英文
检索条件"主题词=Parameterized complexity and algorithms"
2 条 记 录,以下是1-10 订阅
排序:
On the complexity of barrier resilience for fat regions and bounded ply
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2018年 72卷 34-51页
作者: Korman, Matias Loffler, Maarten Silveira, Rodrigo I. Strash, Darren Tohoku Univ Sendai Miyagi Japan Univ Utrecht Dept Comp & Informat Sci Utrecht Netherlands Univ Politecn Cataluna Dept Matemat Barcelona Spain Colgate Univ Dept Comp Sci Hamilton NY 13346 USA
In the barrier resilience problem (introduced by Kumar et al., Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions... 详细信息
来源: 评论
A Colored Path Problem and Its Applications
收藏 引用
ACM TRANSACTIONS ON algorithms 2020年 第4期16卷 1–48页
作者: Eiben, Eduard Kanj, Iyad Royal Holloway Univ London Egham TW20 0EX Surrey England DePaul Univ Sch Comp Chicago IL 60604 USA
Given a set of obstacles and two points in the plane, is there a path between the two points that does not cross more than k different obstacles? Equivalently, can we remove k obstacles so that there is an obstacle-fr... 详细信息
来源: 评论