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

DOI10.4230/lipics.esa.2021.8arXiv2105.06889OpenAlexW3198492908MaRDI QIDQ6075891

Shay Solomon, Sepehr Assadi

Publication date: 20 September 2023

Full work available at URL: https://arxiv.org/abs/2105.06889

zbMATH Keywords

hypergraphmatchingmaximal matchingset coverdynamic graph algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover

This page was built for publication: Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach.