research
∙
06/20/2023
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
We study dynamic (1-ϵ)-approximate rounding of fractional matchings – a ...
share
research
∙
02/16/2023
Incremental (1-ε)-approximate dynamic matching in O(poly(1/ε)) update time
In the dynamic approximate maximum bipartite matching problem we are giv...
research
∙
02/10/2023
Dynamic (1+ε)-Approximate Matching Size in Truly Sublinear Update Time
We show a fully dynamic algorithm for maintaining (1+ϵ)-approximate size...
research
∙
12/01/2022
Sublinear Algorithms for (1.5+ε)-Approximate Matching
We study sublinear time algorithms for estimating the size of maximum ma...
research
∙
10/11/2022
Client Error Clustering Approaches in Content Delivery Networks (CDN)
Content delivery networks (CDNs) are the backbone of the Internet and ar...
research
∙
10/05/2022
Matrix Factorization for Cache Optimization in Content Delivery Networks (CDN)
Content delivery networks (CDNs) are key components of high throughput, ...
research
∙
07/15/2022
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
In the dynamic linear program (LP) problem, we are given an LP undergoin...
research
∙
07/15/2022
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
We present dynamic algorithms with polylogarithmic update time for estim...
research
∙
07/07/2022
Multimodal E-Commerce Product Classification Using Hierarchical Fusion
In this work, we present a multi-modal model for commercial product clas...
research
∙
08/24/2021
Deterministic Dynamic Matching In Worst-Case Update Time
We present deterministic algorithms for maintaining a (3/2 + ϵ) and (2 +...
research
∙
05/04/2021