Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909108797440000 |
|---|---|
| author | Tan, Jingjing |
| author_facet | Tan, Jingjing |
| contents | Team formation problem is a very important problem in the labor market, and it is proved to be NP-hard. In this paper, we design an efficient bicriteria streaming algorithms to construct a balance between gain and cost in a team formation problem with cardinality constraint on the integer lattice. To solve this problem, we establish a model for maximizing the difference between a nonnegative normalized monotone submodule function and a nonnegative linear function. Further, we discuss the case where the first function of the object function is $α$--weakly submodular. Combining the lattice binary search with the threshold method, we present an online algorithm called bicriteria streaming algorithms. Meanwhile, we give detailed analysis for both of these models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_10298 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice Tan, Jingjing Data Structures and Algorithms Discrete Mathematics Team formation problem is a very important problem in the labor market, and it is proved to be NP-hard. In this paper, we design an efficient bicriteria streaming algorithms to construct a balance between gain and cost in a team formation problem with cardinality constraint on the integer lattice. To solve this problem, we establish a model for maximizing the difference between a nonnegative normalized monotone submodule function and a nonnegative linear function. Further, we discuss the case where the first function of the object function is $α$--weakly submodular. Combining the lattice binary search with the threshold method, we present an online algorithm called bicriteria streaming algorithms. Meanwhile, we give detailed analysis for both of these models. |
| title | Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice |
| topic | Data Structures and Algorithms Discrete Mathematics |
| url | https://arxiv.org/abs/2402.10298 |