New combinatorial topology bounds for renaming: the lower bound.
Armando CastañedaSergio RajsbaumPublished in: Distributed Comput. (2010)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- upper and lower bounds
- branch and bound algorithm
- branch and bound
- worst case
- optimal solution
- vc dimension
- lower bounding
- np hard
- objective function
- neural network
- optimal cost
- randomized algorithms
- linear programming relaxation
- sample size
- scheduling problem
- lagrangian relaxation
- competitive ratio
- constant factor
- randomized algorithm