Algorithms and Lower Bounds for the Worker-Task Assignment Problem.
Aaron BergerWilliam KuszmaulAdam PolakJonathan TidorNicole WeinPublished in: CoRR (2020)
Keyphrases
- lower bound
- computational cost
- objective function
- algorithms require
- worst case
- optimization problems
- online algorithms
- lower and upper bounds
- np hard
- combinatorial optimization
- theoretical analysis
- orders of magnitude
- times faster
- running times
- machine learning
- computationally efficient
- evolutionary algorithm
- computational complexity
- bayesian networks
- learning algorithm