Fig. 4From: Efficient computation of optimal temporal walks under waiting-time constraintsRunning time comparison for computing optimal walks with respect to a linear combination (δ1=δ2=…=δ7=1) of different optimization criteria (black) and with respect to cheapest walks (red) for β≡T. Note that the red and black line are on top of each other and hence almost indistinguishable. The (upper) lines with crosses illustrate the average running time and the (lower) lines with boxes show the median running timeBack to article page