A tight time lower bound for space-optimal implementations of multi-writer snapshots.
Panagiota FatourouFaith E. FichEric RuppertPublished in: STOC (2003)
Keyphrases
- lower bound
- worst case
- upper bound
- optimal solution
- optimal cost
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- competitive ratio
- search space
- objective function
- average case
- strongly np hard
- constant factor
- optimal control
- optimal strategy
- higher dimensional
- closed form
- space time
- linear programming relaxation
- lower bounding
- dynamic programming
- np hard
- reinforcement learning
- feature selection