咨询与建议

限定检索结果

文献类型

  • 2 篇 期刊文献
  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 2 篇 理学
    • 2 篇 数学
  • 2 篇 工学
    • 2 篇 计算机科学与技术...
    • 1 篇 电气工程
    • 1 篇 信息与通信工程
    • 1 篇 软件工程
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 3 篇 primal-dual appr...
  • 1 篇 minimum cost sta...
  • 1 篇 total routing co...
  • 1 篇 induced matching
  • 1 篇 wireless sensor ...
  • 1 篇 submodular funct...
  • 1 篇 approximation th...
  • 1 篇 primal-dual meth...
  • 1 篇 linear programmi...
  • 1 篇 telecommunicatio...
  • 1 篇 approximation al...
  • 1 篇 energy-efficient...
  • 1 篇 link costs
  • 1 篇 stashing nodes
  • 1 篇 strong matching
  • 1 篇 mobile sinks

机构

  • 1 篇 ulm univ inst op...
  • 1 篇 queens univ sch ...
  • 1 篇 jst presto kawag...
  • 1 篇 kyushu univ inst...

作者

  • 1 篇 choudhury salimu...
  • 1 篇 rautenbach diete...
  • 1 篇 baste julien
  • 1 篇 kamiyama naoyuki
  • 1 篇 islam kamrul
  • 1 篇 fuerst maximilia...
  • 1 篇 akl selim g.

语言

  • 3 篇 英文
检索条件"主题词=Primal-dual approximation algorithm"
3 条 记 录,以下是1-10 订阅
排序:
A primal-dual approximation algorithm for the Minimum Cost Stashing Problem in Wireless Sensor Networks
A Primal-dual Approximation Algorithm for the Minimum Cost S...
收藏 引用
IEEE 29th International Performance Computing and Communications Conference
作者: Choudhury, Salimur Islam, Kamrul Akl, Selim G. Queens Univ Sch Comp Kingston ON K7L 3N6 Canada
We study the problem of computing an energy-efficient data delivery scheme in wireless sensor networks that leverages the knowledge of a set of trajectories of mobile sinks in the network to route data from the sensor... 详细信息
来源: 评论
A Note on Submodular Function Minimization with Covering Type Linear Constraints
收藏 引用
algorithmICA 2018年 第10期80卷 2957-2971页
作者: Kamiyama, Naoyuki Kyushu Univ Inst Math Ind Fukuoka Japan JST PRESTO Kawaguchi Saitama Japan
In this paper, we consider the non-negative submodular function minimization problem with covering type linear constraints. Assume that there exist m linear constraints, and we denote by the number of non-zero coeffic... 详细信息
来源: 评论
Linear programming based approximation for unweighted induced matchings-Breaking the Δ barrier
收藏 引用
DISCRETE OPTIMIZATION 2020年 38卷 100593-100593页
作者: Baste, Julien Fuerst, Maximilian Rautenbach, Dieter Ulm Univ Inst Optimizat & Operat Res Ulm Germany
A matching in a graph is induced if no two of its edges are joined by an edge, and finding a large induced matching is a very hard problem. Lin et al. (2018) provide an approximation algorithm with ratio Delta for the... 详细信息
来源: 评论