Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
BarıŠCan Esmer, Ariel Kulik, Dániel Marx +2
We generalize the monotone local search approach of Fomin, Gaspers, Lokshtanov and Saurabh [J. ACM 2019], by establishing a connection between parameterized approximation and expon…
cs.DS2024
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
Fateme Abbasi, Sandip Banerjee, JarosÅaw Byrka +6
We consider the well-studied Robust -Clustering problem, which generalizes the classic -Median, -Means, and -Center problems. Given a constant , the input…