| Year |
Citation |
Score |
| 2017 |
Eisenbrand F, Vempala S. Geometric random edge Mathematical Programming. 164: 325-339. DOI: 10.1007/S10107-016-1089-0 |
0.522 |
|
| 2016 |
Artmann S, Eisenbrand F, Glanzer C, Oertel T, Vempala S, Weismantel R. A note on non-degenerate integer programs with small sub-determinants Operations Research Letters. 44: 635-639. DOI: 10.1016/J.Orl.2016.07.004 |
0.438 |
|
| 2012 |
Štefankovič D, Vempala S, Vigoda E. A deterministic polynomial-time approximation scheme for counting knapsack solutions Siam Journal On Computing. 41: 356-366. DOI: 10.1137/11083976X |
0.484 |
|
| 2012 |
Arora S, Lovász L, Newman I, Rabani Y, Rabinovich Y, Vempala S. Local versus global properties of metric spaces Siam Journal On Computing. 41: 250-271. DOI: 10.1137/090780304 |
0.317 |
|
| 2009 |
Belloni A, Freund RM, Vempala S. An Efficient Rescaled Perceptron Algorithm for Conic Systems Mathematics of Operations Research. 34: 621-641. DOI: 10.1287/Moor.1090.0388 |
0.499 |
|
| 2009 |
Stefankovic D, Vempala S, Vigoda E. Adaptive simulated annealing: A near-optimal connection between sampling and counting Journal of the Acm. 56. DOI: 10.1145/1516512.1516520 |
0.424 |
|
| 2008 |
Rademacher L, Vempala S. Dispersion of mass and the complexity of randomized geometric algorithms Advances in Mathematics. 219: 1037-1069. DOI: 10.1016/J.Aim.2008.06.004 |
0.571 |
|
| 2006 |
Kalai AT, Vempala S. Simulated annealing for convex optimization Mathematics of Operations Research. 31: 253-266. DOI: 10.1287/Moor.1060.0194 |
0.476 |
|
| 2006 |
Cheng D, Kannan R, Vempala S, Wang G. A divide-and-merge methodology for clustering Acm Transactions On Database Systems. 31: 1499-1525. DOI: 10.1145/1189769.1189779 |
0.362 |
|
| 2006 |
Lovász L, Vempala S. Hit-and-Run from a Corner Siam Journal On Computing. 35: 985-1005. DOI: 10.1137/S009753970544727X |
0.37 |
|
| 2006 |
Lovász L, Vempala S. Simulated annealing in convex bodies and an O*(n4) volume algorithm Journal of Computer and System Sciences. 72: 392-417. DOI: 10.1016/J.Jcss.2005.08.004 |
0.501 |
|
| 2006 |
Balcan MF, Blum A, Vempala S. Kernels as features: On kernels, margins, and low-dimensional mappings Machine Learning. 65: 79-94. DOI: 10.1007/S10994-006-7550-1 |
0.348 |
|
| 2006 |
Cheriyan J, Vempala S, Vetta A. Network Design Via Iterative Rounding Of Setpair Relaxations Combinatorica. 26: 255-275. DOI: 10.1007/S00493-006-0016-Z |
0.459 |
|
| 2006 |
Papadimitriou CH, Vempala S. On the approximability of the traveling salesman problem Combinatorica. 26: 101-120. DOI: 10.1007/S00493-006-0008-Z |
0.382 |
|
| 2005 |
Kannan R, Salmasian H, Vempala S. The spectral method for general mixture models Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3559: 444-457. DOI: 10.1137/S0097539704445925 |
0.416 |
|
| 2005 |
Kalai A, Vempala S. Efficient algorithms for online decision problems Journal of Computer and System Sciences. 71: 291-307. DOI: 10.1016/J.Jcss.2004.10.016 |
0.356 |
|
| 2004 |
Frieze A, Kannan R, Vempala S. Fast monte-carlo algorithms for finding low-rank approximations Journal of the Acm. 51: 1025-1041. DOI: 10.1145/1039488.1039494 |
0.491 |
|
| 2004 |
Bertsimas D, Vempala S. Solving convex programs by random walks Journal of the Acm. 51: 540-556. DOI: 10.1145/1008731.1008733 |
0.521 |
|
| 2004 |
Drineas P, Frieze A, Kannan R, Vempala S, Vinay V. Clustering large graphs via the Singular Value Decomposition Machine Learning. 56: 9-33. DOI: 10.1023/B:Mach.0000033113.59016.96 |
0.502 |
|
| 2004 |
Bornstein CF, Vempala S. Flow metrics Theoretical Computer Science. 321: 13-24. DOI: 10.1016/J.Tcs.2003.05.003 |
0.444 |
|
| 2004 |
Vempala S, Wang G. A spectral algorithm for learning mixture models Journal of Computer and System Sciences. 68: 841-860. DOI: 10.1016/J.Jcss.2003.11.008 |
0.468 |
|
| 2004 |
Dunagan J, Vempala S. Optimal outlier removal in high-dimensional spaces Journal of Computer and System Sciences. 68: 335-373. DOI: 10.1016/J.Jcss.2003.07.013 |
0.356 |
|
| 2004 |
Carr R, Vempala S. On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems Mathematical Programming. 100: 569-587. DOI: 10.1007/S10107-004-0506-Y |
0.387 |
|
| 2000 |
Blum A, Konjevod G, Ravi R, Vempala S. Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems Theoretical Computer Science. 235: 25-42. DOI: 10.1016/S0304-3975(99)00181-4 |
0.404 |
|
| 2000 |
Vempala S, Vetta A. Factor 4/3 approximations for minimum 2-connected subgraphs Lecture Notes in Computer Science. 262-273. DOI: 10.1007/3-540-44436-X_26 |
0.437 |
|
| 1999 |
Mitchell JSB, Blum A, Chalasani P, Vempala S. A Constant-Factor Approximation Algorithm for the Geometric k -MST Problem in the Plane Siam Journal On Computing. 28: 771-781. DOI: 10.1137/S0097539796303299 |
0.473 |
|
| 1999 |
Awerbuch B, Azar Y, Blum A, Vempala S. New Approximation Guarantees for Minimum-Weight k -Trees and Prize-Collecting Salesmen Siam Journal On Computing. 28: 254-262. DOI: 10.1137/S009753979528826X |
0.44 |
|
| 1999 |
Blum A, Ravi R, Vempala S. A Constant-Factor Approximation Algorithm for thek-MST Problem Journal of Computer and System Sciences. 58: 101-108. DOI: 10.1006/Jcss.1997.1542 |
0.496 |
|
| 1999 |
Kannan R, Tetali P, Vempala S. Simple Markov-chain algorithms for generating bipartite graphs and tournaments Random Structures and Algorithms. 14: 293-308. DOI: 10.1002/(Sici)1098-2418(199907)14:4<293::Aid-Rsa1>3.0.Co;2-G |
0.405 |
|
| Show low-probability matches. |