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
Citace 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.
Citace podle MLA (9th 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.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..