Sharath Raghvendra

From MaRDI portal
Person:1644939

Available identifiers

zbMath Open raghvendra.sharathMaRDI QIDQ1644939

List of research outcomes





PublicationDate of PublicationType
Fast and accurate approximations of the optimal transport in semi-discrete and discrete settings2024-11-28Paper
An improved \(\varepsilon\)-approximation algorithm for geometric bipartite matching2024-05-27Paper
A scalable work function algorithm for the \(k\)-server problem2024-05-27Paper
https://portal.mardi4nfdi.de/entity/Q61473052024-01-15Paper
Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching2023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50889802022-07-18Paper
Improved approximate Rips filtrations with shifted integer lattices and cubical complexes2021-11-05Paper
A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings2021-03-17Paper
A Near-linear Time Δ-Approximation Algorithm for Geometric Bipartite Matching2020-11-11Paper
https://portal.mardi4nfdi.de/entity/Q51165272020-08-18Paper
Improved Approximate Rips Filtrations with Shifted Integer Lattices2020-05-27Paper
A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs2019-12-02Paper
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs2019-10-15Paper
Improved Topological Approximations by Digitization2019-10-15Paper
Polynomial-sized topological approximations using the permutahedron2019-04-25Paper
A \(k\)-median based online algorithm for the stochastic \(k\)-server problem2018-06-22Paper
A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46078802018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q46079112018-03-15Paper
Polynomial-Sized Topological Approximations Using The Permutahedron2018-01-30Paper
Connectivity in Random Forests and Credit Networks2017-10-05Paper

Research outcomes over time

This page was built for person: Sharath Raghvendra