态度暖昧
发表于 2025-3-30 12:11:11
Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function m in a noisy environment for the first time. In addition, our study will be conducted under two situations, that is, the cardinality constraint and the matroid constraint. Based on these two situations, we propose two bicriteria approximation algorithms respectively and all these algorithms can obtain good results.
唤起
发表于 2025-3-30 16:03:25
0302-9743 nt due to the COVID-19 pandemic..The 41 regular papers included in this book were carefully reviewed and selected from 59 submissions. .978-3-031-16080-6978-3-031-16081-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
Euthyroid
发表于 2025-3-30 18:10:32
https://doi.org/10.1007/978-3-658-42828-0 that there is no on-line algorithm with a constant competitive ratio if the penalty submodular function is nonmonotone. When the penalty submodular function is monotone, we present an on-line algorithm with a competitive ratio 3.
有偏见
发表于 2025-3-30 23:14:52
http://reply.papertrans.cn/16/1529/152886/152886_54.png
pester
发表于 2025-3-31 01:30:09
0302-9743 which was held online during August 13-14, 2022. The conference was originally planned to take place in Guangzhou, China, but changed to a virtual event due to the COVID-19 pandemic..The 41 regular papers included in this book were carefully reviewed and selected from 59 submissions. .978-3-031-1608
使绝缘
发表于 2025-3-31 05:36:38
https://doi.org/10.1007/978-3-658-18398-1 instance. This is also proved to be the best possible mechanism. For obnoxious two-facility location games with facility candidate locations, we study the heterogeneous facility case in this paper. We design a group strategy-proof mechanism and prove that the approximation ratio is 2. We also prove that the problem lower bound is ..