a**f
发帖数: 13 | 1 这个该死敌教授上课从来不将这些，可作业全是这些题，拜托了：
Consider a network where the weight on the link represents the delay
on that link and it varies with time. Suppose that between a specified
source-destination pair (s,d) there are r different paths, P1,
P2,...Pr.
The path lengths are denoted PL1, PL2, ... PLr. Time is measured in
discrete slots from 1 to T. Since the link weights change with time,
the
length of the paths also change with time. The shortest path length
from
s to d at any time t is denoted by Popt(t | z****b
发帖数: 1 | 2 you can check with books on approximation algorithms
for NP hard problems.
【在 a**f 的大作中提到】
: 这个该死敌教授上课从来不将这些，可作业全是这些题，拜托了：
: Consider a network where the weight on the link represents the delay
: on that link and it varies with time. Suppose that between a specified
: source-destination pair (s,d) there are r different paths, P1,
: P2,...Pr.
: The path lengths are denoted PL1, PL2, ... PLr. Time is measured in
: discrete slots from 1 to T. Since the link weights change with time,
: the
: length of the paths also change with time. The shortest path length
: from
|
|
