Lower bounds for linear interval routing.

Tamar Eilam Shlomo Moran Shmuel Zaks

Published in: Networks (1999)

Keyphrases

lower bound
upper bound
branch and bound algorithm
branch and bound
special case
np hard
routing problem
linear model
neural network
lower and upper bounds
shortest path
routing protocol
upper and lower bounds
ad hoc networks
closed form
sufficient conditions
worst case
least squares
optimal solution