( en | de | ru )

 

Disambiguation of "Vempala, Santosh S."

Author of the publication

copydeleteadd this publication to your clipboard
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph.

, , and . SIAM J. Comput., 32 (4): 1050-1055 (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.

Santosh Panjikar

Santosh Noronha

Santosh Nepal

Santosh Vijayan

Santosh Hosmani

 

Other publications of authors with the same name

Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev., and . STOC, page 1122-1129. ACM, (2018)Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems., , , and . Theor. Comput. Sci., 235 (1): 25-42 (2000)The Random Projection Method. DIMACS Series in Discrete Mathematics and Theoretical Computer Science DIMACS/AMS, (2004)Solving Sparse Linear Systems Faster than Matrix Multiplication., and . SODA, page 504-521. SIAM, (2021)Fences Are Futile: On Relaxations for the Linear Ordering Problem., and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 333-347. Springer, (2001)Approximating Multicast Congestion., and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 367-372. Springer, (1999)Cortical Learning via Prediction., and . COLT, volume 40 of JMLR Workshop and Conference Proceedings, page 1402-1422. JMLR.org, (2015)Complexity of learning subspace juntas and ICA., and . ACSSC, page 320-324. IEEE, (2013)On Noise-Tolerant Learning of Sparse Parities and Related Problems., , and . ALT, volume 6925 of Lecture Notes in Computer Science, page 413-424. Springer, (2011)A New Approach to Strongly Polynomial Linear Programming., and . ICS, page 42-48. Tsinghua University Press, (2010)