Tang, Z., Chen, J., & Wang, C. (2024). Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization. Theoretical computer science, 984, 114320. https://doi.org/10.1016/j.tcs.2023.114320
Citácia podle Chicago (17th ed.)Tang, Zhongzheng, Jingwen Chen, a Chenhao Wang. "Greedy+Singleton: An Efficient Approximation Algorithm for K-submodular Knapsack Maximization." Theoretical Computer Science 984 (2024): 114320. https://doi.org/10.1016/j.tcs.2023.114320.
Citácia podľa MLA (8th ed.)Tang, Zhongzheng, et al. "Greedy+Singleton: An Efficient Approximation Algorithm for K-submodular Knapsack Maximization." Theoretical Computer Science, vol. 984, 2024, p. 114320, https://doi.org/10.1016/j.tcs.2023.114320.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..