3 papers
cs.DS2026
Adaptive Fully Dynamic -Center Clustering with (Near-)Optimal Worst-Case Guarantees
Mara Grilnberger, Antonis Skarlatos
Given a sequence of adversarial point insertions and point deletions, is it possible to simultaneously optimize the approximation ratio, update time, and recourse for a -cluster…
cs.DS2026
A Weighted-to-Unweighted Reduction for Matroid Intersection
Aditi Dudeja, Mara Grilnberger
Given two matroids and over the same ground set, the matroid intersection problem is to find the maximum cardinality common independent set. In the…
cs.DS2025
Dynamic Matroids: Base Packing and Covering
Tijn de Vos, Mara Grilnberger
In this paper, we consider dynamic matroids, where elements can be inserted to or deleted from the ground set over time. The independent sets change to reflect the current ground s…