In this work, we propose the first constant-approximation algorithms,
LinAst and LinAtg, which simultaneously achieve optimal
query complexity O(n) and adaptive complexity O(log n) for non-monotone
submodular maximization under a cardinality constraint k over a ground set of
size n. Specifically, compared with existing...
Canh V. Pham, Tan D. Tran, Dung T. K. Ha et al.· Proceedings of the Thirty-Fi...· 0 citations
Comprehensive experiments on standard benchmark datasets demonstrate that the introduced constant-factor approximation algorithm achieves competitive objective values while maintaining a favorable balance between fairness guarantees and query complexity efficiency compared to existing state-of-the-art methods.
Tan D. Tran, Canh V. Pham, P. Pham· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.