Complexity

Research Article

Semantic-Aware Top-k Multirequest Optimal Route

Table 5

Running example of Algorithm 1 for Figure 1.


Step	Routes(route(\|NR\|, ave(R)),x)

1	((0,0),1)
2	((1,70),1)
3	((2,75),1),((1,90),2)
4	((3,83.3),1),((1,90),2),((2,95),2)
5	((5,80),1),((1,90),2),((2,95),2),((4,107.5),2)
6	(〈s,v₂,v₃,v₅,v₉〉(5,80),1),((1,90),2),((2,95),2),((4,107.5),2)
7	((1,90),2),((2,95),2),((4,107.5),2)
8	((3,90),1),((2,95),2),((4,107.5),2),((1,120),3)
9	((2,95),2),((4,105),1),((4,107.5),2),((1,120),3),((2,210),2)
10	((4,85),1),((4,105),1),((4,107.5),2),((1,120),3),((2,210),2)