Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Sharath Raghvendra"'
Publikováno v:
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c2734c9131f3d844850bd01c911b9dd
https://doi.org/10.1145/3519935.3519977
https://doi.org/10.1145/3519935.3519977
Autor:
Sharath Raghvendra, Pankaj K. Agarwal
Publikováno v:
Journal of the ACM. 67:1-19
For point sets A , B ⊂ R d , ∣ A ∣ = ∣ B ∣ = n , and for a parameter ε > 0, we present a Monte Carlo algorithm that computes, in O ( n poly(log n , 1/ε)) time, an ε-approximate perfect matching of A and B under any L p -norm with high pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80e0bb571abc898af8b0dcdddf720cea
https://doi.org/10.1145/3393694
https://doi.org/10.1145/3393694
Publikováno v:
ACM Transactions on Algorithms. 16:1-30
Given a weighted planar bipartite graph G ( A ∪ B , E ) where each edge has an integer edge cost, we give an Õ( n 4/3 log nC ) time algorithm to compute minimum-cost perfect matching; here C is the maximum edge cost in the graph. The previous best
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c920cb17f1c61aef7917acfb2d480ba
https://doi.org/10.1145/3365006
https://doi.org/10.1145/3365006
Publikováno v:
Journal of Applied and Computational Topology
Rips complexes are important structures for analyzing topological features of metric spaces. Unfortunately, generating these complexes is expensive because of a combinatorial explosion in the complex size. For $n$ points in $\mathbb{R}^d$, we present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::532419c7332ad391444840ab8794d463
https://refubium.fu-berlin.de/handle/fub188/30760
https://refubium.fu-berlin.de/handle/fub188/30760
Autor:
Thomas C. H. Lux, Tyler H. Chang, Li Xu, Yili Hong, Bo Li, Ali R. Butt, Kirk W. Cameron, Sharath Raghvendra, Layne T. Watson
Publikováno v:
SoutheastCon 2018.
Delaunay triangulations and their geometric dual Voronoi diagrams are carefully studied topics in computational geometry and have numerous applications spanning fields such as physics, engineering, geographic information systems, and computer graphic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d601943fc0cbeb76b546a85542ee4e9e
https://doi.org/10.1109/secon.2018.8479003
https://doi.org/10.1109/secon.2018.8479003
Publikováno v:
Approximation and Online Algorithms ISBN: 9783319894409
WAOA
WAOA
We consider the k-server problem in the random arrival model and present a simple k-median based algorithm for this problem. Let \(\sigma =\langle r_1,\ldots , r_n\rangle \) be the sequence of requests. Our algorithm will batch the requests into \(\l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a8a00c79d072b45790da515d3679a09
https://doi.org/10.1007/978-3-319-89441-6_14
https://doi.org/10.1007/978-3-319-89441-6_14
Autor:
Krati Nayyar, Sharath Raghvendra
Publikováno v:
FOCS
We present a novel input sensitive analysis of a deterministic online algorithm \cite{r_approx16} for the minimum metric bipartite matching problem. We show that, in the adversarial model, for any metric space \metric and a set of n servers S, the co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::975ce976c586166de462bddfba268550
https://doi.org/10.1109/focs.2017.53
https://doi.org/10.1109/focs.2017.53