咨询与建议

限定检索结果

文献类型

  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 电气工程
    • 1 篇 计算机科学与技术...

主题

  • 1 篇 parallel algorit...
  • 1 篇 approximations a...
  • 1 篇 set cover
  • 1 篇 facility locatio...
  • 1 篇 max cover

机构

  • 1 篇 carnegie mellon ...

作者

  • 1 篇 blelloch guy e.
  • 1 篇 peng richard
  • 1 篇 tangwongsan kana...

语言

  • 1 篇 英文
检索条件"主题词=approximations algorithms"
1 条 记 录,以下是1-10 订阅
排序:
Linear-Work Greedy Parallel Approximate Set Cover and Variants  11
Linear-Work Greedy Parallel Approximate Set Cover and Varian...
收藏 引用
23rd Annual Symposium on Parallelism in algorithms and Architectures
作者: Blelloch, Guy E. Peng, Richard Tangwongsan, Kanat Carnegie Mellon Univ Pittsburgh PA 15213 USA
We present parallel greedy approximation algorithms for set cover and related problems. These algorithms build on an algorithm for solving a graph problem we formulate and study called Maximal Nearly Independent Set (... 详细信息
来源: 评论