Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound.
Philip CervenjakJunhao GanSeeun William UmbohAnthony WirthPublished in: CoRR (2024)
Keyphrases
- lower bound
- upper bound
- polynomial approximation
- integrality gap
- linear programming relaxation
- polynomial time approximation
- branch and bound algorithm
- np hard
- constant factor
- optimal solution
- upper and lower bounds
- arbitrarily close
- lower and upper bounds
- approximation schemes
- approximation guarantees
- branch and bound
- randomized approximation
- objective function
- worst case
- approximation algorithms
- pointwise
- partition function
- data streams
- closed form
- special case
- real time
- conjugate gradient algorithm
- computational complexity
- space time
- numerical scheme
- competitive ratio
- lower bounding
- error bounds
- approximation error