3 citations · 3 across the 8 of their papers we have counts for
Showing 2018 · cs.CGShow all
2 papers · 2 filters
cs.CG2018
Improved Topological Approximations by Digitization
Aruni Choudhary, Michael Kerber, Sharath Raghvendra
Čech complexes are useful simplicial complexes for computing and analyzing topological features of data that lies in Euclidean space. Unfortunately, computing these complexes becom…
cs.CG2018
Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line
Sharath Raghvendra
In the online metric bipartite matching problem, we are given a set of server locations in a metric space. Requests arrive one at a time, and on its arrival, we need to immedia…