Fast algorithms combining threshold-decreasing and greedy methods for maximizing constraint k-submodular functions.
Saved in:
| Title: | Fast algorithms combining threshold-decreasing and greedy methods for maximizing constraint k-submodular functions. |
|---|---|
| Authors: | Niu, Shuxian1 (AUTHOR) niushuxianBetty@163.com, Liu, Qian1 (AUTHOR) lq_qsh@163.com, Zhou, Yang1 (AUTHOR) zhouyang@sdnu.edu.cn, Li, Min1 (AUTHOR) liminemily@sdnu.edu.cn |
| Source: | Discrete Mathematics, Algorithms & Applications. May2025, Vol. 17 Issue 4, p1-13. 13p. |
| Database: | Mathematics Source |
| ISSN: | 17938309 |
|---|---|
| DOI: | 10.1142/S1793830924500617 |
