Shay Sapir

activity

20202026

most citedModerate Dimension Reduction for

k

-Center Clustering

1 citations · 2 across the 10 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Parks and Recreation: Color Fault-Tolerant Spanners Made Local

Merav Parter, Asaf Petruschka, Shay Sapir +1

We provide new algorithms for constructing spanners of arbitrarily edge- or vertex-colored graphs, that can endure up to $f$ failures of entire color classes. The failure of even a…

cs.DS2024

Connectivity Labeling in Faulty Colored Graphs

Asaf Petruschka, Shay Sapir, Elad Tzalik

Fault-tolerant connectivity labelings are schemes that, given an $n$ -vertex graph $G = (V, E)$ and $f \geq 1$ , produce succinct yet informative labels for the elements of the graph. Gi…