( en | de | ru )

 

Disambiguation of "Arora, Sanjeev"

Author of the publication

copydeleteadd this publication to your clipboard
A 2+epsilon approximation algorithm for the k-MST problem.

, and . SODA, page 754-759. ACM/SIAM, (2000)

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.

Sanjeev Kumar

Sachin Arora

Sanjeev Sarpal

Deepika Arora

Deepak Arora

 

Other publications of authors with the same name

Improved Algorithms for Unique Games via Divide and Conquer., , , and . Electron. Colloquium Comput. Complex., (2010)A Sample Complexity Separation between Non-Convex and Convex Meta-Learning., , , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 8512-8521. PMLR, (2020)A Mathematical Exploration of Why Language Models Help Solve Downstream Tasks., , and . ICLR, OpenReview.net, (2021)Towards Provable Control for Unknown Linear Dynamical Systems., , , , , and . ICLR (Workshop), OpenReview.net, (2018)Exploring complexity through reductions.. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)A Practical Algorithm for Topic Modeling with Provable Guarantees, , , , , , , and . CoRR, (2012)Towards a Study of Low-Complexity Graphs., , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 119-131. Springer, (2009)Unique games on expanding constraint graphs are easy: extended abstract., , , , , and . STOC, page 21-28. ACM, (2008)A combinatorial, primal-dual approach to semidefinite programs., and . STOC, page 227-236. ACM, (2007)Semidefinite Programming and Approximation Algorithms: A Survey.. SWAT, volume 6139 of Lecture Notes in Computer Science, page 25. Springer, (2010)