A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line.
Tsubasa HaradaPublished in: CoRR (2024)
Keyphrases
- competitive ratio
- lower bound
- online algorithms
- objective function
- average case
- single machine
- learning algorithm
- np hard
- online learning
- optimal strategy
- optimal solution
- randomized algorithm
- expectation maximization
- processing times
- worst case
- upper bound
- theoretical analysis
- scheduling problem
- probabilistic model
- branch and bound
- dynamic programming
- single machine scheduling problem
- monte carlo sampling
- linear programming
- computational complexity
- search space
- memory efficient
- memory space
- hybrid algorithm
- monte carlo
- machine learning