References
Nanongkai D, Sarm A D, Lall A, Lipton R J, Xu J. Regret-minimizing representative databases. In: Proceedings of the 36th International Conference on Very Large Data Bases. 2010, 1114–1124
Zeighami S, Wong R C. Finding average regret ratio minimizing set in database. In: Proceedings of the 35th International Conference on Data Engineering. 2019, 1722–1725
Mitzenmacher M, Upfal E. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005
Krause A, Golovin D. Submodular function maximization. Tractability: Practical Approaches to Hard Problems, 2014, 3: 71–104
Nemhauser G L, Wolsey L A, Fisher M L. An analysis of approximations for maximizing submodular set functions—I. Mathematical Programming, 1978, 14(1): 265–294
Acknowledgements
This work was partially supported by the Fundamental Research Funds for the Central Universities (NS2020068), the National Natural Science Foundation of China (U1733112, 61702260).
Author information
Authors and Affiliations
Corresponding author
Additional information
Supporting information
The supporting information is available online at journal.hep.com.cn and link.springer.com.
Rights and permissions
About this article
Cite this article
Zheng, J., Dong, Q., Qiu, X. et al. Accelerated algorithms for maximizing average happiness ratio in databases. Front. Comput. Sci. 15, 156618 (2021). https://doi.org/10.1007/s11704-020-0178-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11704-020-0178-7