Scholarlink

Team formation problem is a very important problem in the labor market, and it is proved to be NP-hard. This paper proposes an efficient bicriteria streaming algorithm aimed at striking a balance between gain and cost in team formation problems with cardinality constraints on the integer lattice. In addressing this, we utilize a optimized model of maximizing the difference between a nonnegative normalized monotone submodule function and a nonnegative linear function. Combining the lattice binary search with the threshold method, we present an online algorithm called bicriteria streaming algorithms.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Streaming Algorithm for Balance Gain and Cost with Cardinality Constraint on the Integer Lattice

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Jingjing Tan,
  • Cuiping Ge,
  • Fengmin Wang,
  • Ziyang Li

摘要

Team formation problem is a very important problem in the labor market, and it is proved to be NP-hard. This paper proposes an efficient bicriteria streaming algorithm aimed at striking a balance between gain and cost in team formation problems with cardinality constraints on the integer lattice. In addressing this, we utilize a optimized model of maximizing the difference between a nonnegative normalized monotone submodule function and a nonnegative linear function. Combining the lattice binary search with the threshold method, we present an online algorithm called bicriteria streaming algorithms.