Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms.
Ran AdlerYossi AzarPublished in: J. Sched. (2003)
Keyphrases
- lower bound
- worst case
- upper bound
- randomized algorithms
- upper and lower bounds
- randomized algorithm
- theoretical analysis
- computationally efficient
- objective function
- disjoint paths
- learning algorithm
- data structure
- np hard
- control system
- online algorithms
- lower and upper bounds
- average case
- finding optimal solutions
- control strategy
- branch and bound algorithm
- single machine
- branch and bound
- constraint satisfaction problems
- graphical models
- computational cost