Sharath Raghvendra
Sharath Raghvendra
Associate Professor at Virginia Tech
Bestätigte E-Mail-Adresse bei vt.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A near-linear time ε-approximation algorithm for geometric bipartite matching
R Sharathkumar, PK Agarwal
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
412012
Algorithms for the transportation problem in geometric settings
R Sharathkumar, PK Agarwal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
372012
A robust and optimal online algorithm for minimum metric bipartite matching
S Raghvendra
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
362016
Streaming algorithms for extent problems in high dimensions
PK Agarwal, R Sharathkumar
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
362010
Approximate Čech complex in low and high dimensions
M Kerber, R Sharathkumar
International Symposium on Algorithms and Computation, 666-676, 2013
352013
Approximation algorithms for bipartite matching with metric and geometric costs
PK Agarwal, R Sharathkumar
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
332014
An input sensitive online algorithm for the metric bipartite matching problem
K Nayyar, S Raghvendra
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
282017
Streaming algorithms for extent problems in high dimensions
PK Agarwal, R Sharathkumar
Algorithmica 72 (1), 83-98, 2015
262015
Streaming algorithms for extent problems in high dimensions
PK Agarwal, R Sharathkumar
Algorithmica 72 (1), 83-98, 2015
262015
Approximate Euclidean shortest paths amid convex obstacles
PK Agarwal, R Sharathkumar, H Yu
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
252009
Approximate Euclidean shortest paths amid convex obstacles
PK Agarwal, R Sharathkumar, H Yu
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
252009
Polynomial-sized topological approximations using the permutahedron
A Choudhary, M Kerber, S Raghvendra
Discrete & Computational Geometry 61 (1), 42-80, 2019
222019
Range-aggregate proximity queries
R Sharathkumar, P Gupta
Technical Report IIIT/TR/2007/80, IIIT Hyderabad, 2007
202007
Optimal analysis of an online algorithm for the bipartite matching problem on a line
S Raghvendra
arXiv preprint arXiv:1803.07206, 2018
182018
Approximation and streaming algorithms for projective clustering via random projections
M Kerber, S Raghvendra
arXiv preprint arXiv:1407.2063, 2014
182014
A graph theoretic additive approximation of optimal transport
N Lahn, D Mulchandani, S Raghvendra
arXiv preprint arXiv:1905.11830, 2019
152019
A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
MK Asathulla, S Khanna, N Lahn, S Raghvendra
ACM Transactions on Algorithms (TALG) 16 (1), 1-30, 2019
112019
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
R Sharathkumar
Proceedings of the twenty-ninth annual symposium on Computational geometry, 9-16, 2013
102013
A faster algorithm for minimum-cost bipartite matching in minor-free graphs
N Lahn, S Raghvendra
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
82019
Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts.
R Sharathkumar, P Gupta
CCCG, 2006
82006
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20