On the Lower Bound of the Competitive Ratio for the Weighted Online Roommates Problem.
Satyajit BanerjeePublished in: Discret. Math. Algorithms Appl. (2010)
Keyphrases
- competitive ratio
- online algorithms
- lower bound
- online learning
- average case
- single machine
- worst case
- upper bound
- learning algorithm
- processing times
- branch and bound algorithm
- np hard
- optimal strategy
- optimal solution
- branch and bound
- lower and upper bounds
- initially unknown
- convergence rate
- randomized algorithm
- pattern classification
- decision boundary
- sample size
- completion times
- scheduling problem