Author of the publication

Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm.

, , and . AAIM, volume 13513 of Lecture Notes in Computer Science, page 144-155. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game., , , and . Inf. Process. Lett., (2021)On maximizing a monotone k-submodular function under a knapsack constraint., , and . CoRR, (2021)Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles., , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 266-277. Springer, (2016)Triangle packing and covering in dense random graphs., and . J. Comb. Optim., 44 (4): 3153-3164 (2022)Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization., , , , and . COCOA (1), volume 14461 of Lecture Notes in Computer Science, page 287-299. Springer, (2023)Noise-Resilient Similarity Preserving Network Embedding for Social Networks., , , , and . IJCAI, page 3282-3288. ijcai.org, (2019)Coded multicasting in cache-enabled vehicular ad hoc network., , , , , , and . Comput. Networks, (2019)An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization., , and . IJTCS-FAW, volume 13933 of Lecture Notes in Computer Science, page 15-28. Springer, (2023)A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size., , , and . J. Comb. Optim., 45 (1): 37 (2023)Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance., , , , , and . SAGT, volume 11059 of Lecture Notes in Computer Science, page 256-260. Springer, (2018)