On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k.

Timothy M. Chan Qizheng He Yuancheng Yu

Published in: CoRR (2023)

Keyphrases

small size
fine grained
set cover
coarse grained
greedy algorithm
access control
approximation algorithms
network flow
worst case
tightly coupled
np hard
space complexity
metadata
solution space
greedy heuristics
data lineage