( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
k-Submodular Cover Problem: Application and Algorithms.

, , , , , и . SoICT, стр. 442-449. ACM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Canh Tran

Tran Canh

Isabella Canha dos Santos

David Canham

Le Canh Hoa

 

Другие публикации лиц с тем же именем

Limiting the Spread of Epidemics within Time Constraint on Online Social Networks., , , , и . SoICT, стр. 262-269. ACM, (2017)A new viral marketing strategy with the competition in the large-scale online social networks., , , , и . RIVF, стр. 1-6. IEEE, (2016)Minimum budget for misinformation detection in online social networks with provable guarantees., , , и . Optim. Lett., 16 (2): 515-544 (2022)Minimum budget for misinformation blocking in online social networks., , , , и . J. Comb. Optim., 38 (4): 1101-1127 (2019)Targeted Misinformation Blocking on Online Social Networks., , и . ACIIDS (1), том 10751 из Lecture Notes in Computer Science, стр. 107-116. Springer, (2018)Influence Maximization with Priority in Online Social Networks., , , , и . Algorithms, 13 (8): 183 (2020)Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint., , , и . IJCAI, стр. 4127-4135. ijcai.org, (2023)Efficient Algorithm for Multiple Benefit Thresholds Problem in Online Social Networks., , , , и . RIVF, стр. 1-6. IEEE, (2021)Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint., , , и . DSAA, стр. 1-10. IEEE, (2022)Maximizing misinformation restriction within time and budget constraints., , , , и . J. Comb. Optim., 35 (4): 1202-1240 (2018)