Peter Kiss

activity

20222026

most citedClient Error Clustering Approaches in Content Delivery Networks (CDN)

2 citations · 4 across the 8 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.DS2023

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs

Sayan Bhattacharya, Peter Kiss, Aaron Sidford +1

We study dynamic $(1 - ε)$ -approximate rounding of fractional matchings -- a key ingredient in numerous breakthroughs in the dynamic graph algorithms literature. Our first contributi…

cs.DS2023

Incremental $(1 - ε)$ -approximate dynamic matching in $O (p o l y (1/ ε))$ update time

Joakim Blikstad, Peter Kiss

In the dynamic approximate maximum bipartite matching problem we are given bipartite graph $G$ undergoing updates and our goal is to maintain a matching of $G$ which is large compa…

cs.DS2023

Dynamic $(1 + ε)$ -Approximate Matching Size in Truly Sublinear Update Time

Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak

We show a fully dynamic algorithm for maintaining $(1 + ε)$ -approximate \emph{size} of maximum matching of the graph with $n$ vertices and $m$ edges using $m^{0.5 - Ω_{ε} (1)}$ update tim…

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs

Incremental (1−ε)-approximate dynamic matching in O(poly(1/ε)) update time

Dynamic (1+ε)-Approximate Matching Size in Truly Sublinear Update Time

Incremental $(1 - ε)$ -approximate dynamic matching in $O (p o l y (1/ ε))$ update time

Dynamic $(1 + ε)$ -Approximate Matching Size in Truly Sublinear Update Time