( en | de | ru )

 

Disambiguation of "Sviridenko, Maxim"

Author of the publication

copydeleteadd this publication to your clipboard
Integrated Supply Chain Management via Randomized Rounding.

, and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 562-573. Springer, (2014)

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.

Petru Joan Maxim

Angela Maximini

Adel Maximos

Alexander Maximov

Maria Maxim

 

Other publications of authors with the same name

Approximating the minimum quadratic assignment problems., , and . ACM Trans. Algorithms, 6 (1): 18:1-18:10 (2009)TSI: An Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity., , , , , and . CIKM, page 4036-4045. ACM, (2021)Concentration and moment inequalities for polynomials of independent random variables., and . SODA, page 437-446. SIAM, (2012)Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines., and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 387-398. Springer, (2013)On Hardness of Pricing Items for Single-Minded Bidders., , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 202-216. Springer, (2009)Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime., and . ICML, volume 162 of Proceedings of Machine Learning Research, page 1175-1197. PMLR, (2022)Gradient Descent Converges Linearly for Logistic Regression on Separable Data., and . ICML, volume 202 of Proceedings of Machine Learning Research, page 1302-1319. PMLR, (2023)An Algorithm for Online K-Means Clustering., , and . ALENEX, page 81-89. SIAM, (2016)Online make-to-order joint replenishment model: primal dual competitive algorithms., , , , and . SODA, page 952-961. SIAM, (2008)Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs., , , , , and . ACM Trans. Algorithms, 4 (3): 34:1-34:17 (2008)