Author of the publication

Preemptive and Non-Preemptive Generalized Min Sum Set Cover.

, , and . STACS, volume 14 of LIPIcs, page 465-476. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)

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

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties., , and . Math. Oper. Res., 35 (4): 795-806 (2010)An Algorithm for Online K-Means Clustering., , and . ALENEX, page 81-89. SIAM, (2016)Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs., , , , , and . ACM Trans. Algorithms, 4 (3): 34:1-34:17 (2008)Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms., , , , and . Operations Research, 61 (4): 1014-1029 (2013)Discretization orders for distance geometry problems., , , , , and . Optim. Lett., 6 (4): 783-796 (2012)Online make-to-order joint replenishment model: primal dual competitive algorithms., , , , and . SODA, page 952-961. SIAM, (2008)Integrated Supply Chain Management via Randomized Rounding., and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 562-573. Springer, (2014)Sparse Convex Optimization via Adaptively Regularized Hard Thresholding., and . J. Mach. Learn. Res., (2021)Approximating the minimum quadratic assignment problems., , and . ACM Trans. Algorithms, 6 (1): 18:1-18:10 (2009)Minimizing Makespan in No-Wait Job Shops., , and . Math. Oper. Res., 30 (4): 817-831 (2005)