Author of the publication

On the Complexity of Approximating k-Dimensional Matching.

, , and . RANDOM-APPROX, volume 2764 of Lecture Notes in Computer Science, page 83-97. Springer, (2003)

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

Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier., and . CoRR, (2015)Online Learning for Loss Functions with Memory and Applications to Statistical Arbitrage, , and . CoRR, (2013)Exponentiated Gradient Meets Gradient Descent., , and . ALT, volume 117 of Proceedings of Machine Learning Research, page 386-407. PMLR, (2020)Faster Projection-free Online Learning., and . COLT, volume 125 of Proceedings of Machine Learning Research, page 1877-1893. PMLR, (2020)The Gradient Complexity of Linear Regression., , , and . COLT, volume 125 of Proceedings of Machine Learning Research, page 627-647. PMLR, (2020)Sparse Approximate Solutions to Semidefinite Programs.. LATIN, volume 4957 of Lecture Notes in Computer Science, page 306-316. Springer, (2008)Partial Matrix Completion., , and . CoRR, (2022)Better algorithms for benign bandits., and . SODA, page 38-47. SIAM, (2009)Projection-free Adaptive Regret with Membership Oracles., , , and . ALT, volume 201 of Proceedings of Machine Learning Research, page 1055-1073. PMLR, (2023)A Polylog Pivot Steps Simplex Algorithm for Classification., and . NIPS, page 638-646. (2012)