A New Dynamic Algorithm for Densest Subhypergraphs

04/17/2022
by   Suman K. Bera, et al.
0

Computing a dense subgraph is a fundamental problem in graph mining, with a diverse set of applications ranging from electronic commerce to community detection in social networks. In many of these applications, the underlying context is better modelled as a weighted hypergraph that keeps evolving with time. This motivates the problem of maintaining the densest subhypergraph of a weighted hypergraph in a dynamic setting, where the input keeps changing via a sequence of updates (hyperedge insertions/deletions). Previously, the only known algorithm for this problem was due to Hu et al. [HWC17]. This algorithm worked only on unweighted hypergraphs, and had an approximation ratio of (1+ϵ)r^2 and an update time of O(poly (r, log n)), where r denotes the maximum rank of the input across all the updates. We obtain a new algorithm for this problem, which works even when the input hypergraph is weighted. Our algorithm has a significantly improved (near-optimal) approximation ratio of (1+ϵ) that is independent of r, and a similar update time of O(poly (r, log n)). It is the first (1+ϵ)-approximation algorithm even for the special case of weighted simple graphs. To complement our theoretical analysis, we perform experiments with our dynamic algorithm on large-scale, real-world data-sets. Our algorithm significantly outperforms the state of the art [HWC17] both in terms of accuracy and efficiency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2020

An Improved Algorithm for Dynamic Set Cover

We consider the minimum set cover problem in a dynamic setting. Here, we...
research
02/25/2020

Dynamic Set Cover: Improved Amortized and Worst-Case Update Time

In the dynamic minimum set cover problem, a challenge is to minimize the...
research
05/14/2021

Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach

In the (fully) dynamic set cover problem, we have a collection of m sets...
research
01/10/2022

Implementation of polygon guarding algorithms for art gallery problems

Victor Klee introduce the art gallery problem during a conference in Sta...
research
01/09/2018

Risk-Averse Matchings over Uncertain Graph Databases

A large number of applications such as querying sensor networks, and ana...
research
07/05/2019

Near-Optimal Fully Dynamic Densest Subgraph

We give the first fully dynamic algorithm which maintains a (1+ϵ)-approx...
research
08/01/2023

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier

The dynamic set cover problem has been subject to extensive research sin...

Please sign up or login with your details

Forgot password? Click here to reset