Semi-oblivious routing: lower bounds.
Mohammad Taghi HajiaghayiRobert KleinbergTom LeightonPublished in: SODA (2007)
Keyphrases
- lower bound
- upper bound
- branch and bound
- network topology
- lower and upper bounds
- np hard
- objective function
- routing algorithm
- routing protocol
- ad hoc networks
- optimal solution
- routing problem
- branch and bound algorithm
- upper and lower bounds
- worst case
- inter domain
- quadratic assignment problem
- randomly generated problems
- routing decisions
- optimal cost
- wireless ad hoc networks
- shortest path
- lower bounding
- network layer
- mobile ad hoc networks
- vc dimension
- sample complexity
- min sum