Author of the publication

Approximation Algorithm for Maximizing Nonnegative Weakly Monotonic Set Functions.

, , , and . CSoNet, volume 13116 of Lecture Notes in Computer Science, page 50-58. Springer, (2021)

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

Approximating Robust Parameterized Submodular Function Maximization in Large-Scales., , , , and . Asia Pac. J. Oper. Res., 36 (4): 1950022:1-1950022:24 (2019)Improved approximation algorithm for universal facility location problem with linear penalties., , , and . Theor. Comput. Sci., (2019)Approximation and hardness results for the Max k-Uncut problem., , and . Theor. Comput. Sci., (2018)The k-level facility location game., and . Oper. Res. Lett., 34 (4): 421-426 (2006)An Adaptive Algorithm for Maximization of Non-submodular Function with a Matroid Constraint., , , and . CSoNet, volume 12575 of Lecture Notes in Computer Science, page 3-13. Springer, (2020)Online One-Sided Smooth Function Maximization., , , and . COCOON, volume 13595 of Lecture Notes in Computer Science, page 177-185. Springer, (2022)The Spherical k-means++ Algorithm via Local Search., , , and . AAIM, volume 12290 of Lecture Notes in Computer Science, page 131-140. Springer, (2020)A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem., , and . AAIM, volume 6124 of Lecture Notes in Computer Science, page 253-260. Springer, (2010)Universal Facility Location in Generalized Metric Space., , , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 591-602. Springer, (2019)Approximation and Hardness Results for the Max k-Uncut Problem., , , and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 49-61. Springer, (2016)