Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance

Table 2

Computational results of the Algorithm 16 and that of implicit enumeration algorithm.

NI	𝑛	𝑚	𝑟	VC	VC1	TC	TC1
100	25	35	5	7.5	5.2	0.29	1068.61
100	30	40	5	7.4	5.3	0.53	4687.8
100	35	45	5	7.2	5.7	0.78	8512.14
50	35	50	5	7.6	5.6	0.9	11360.04
50	40	50	10	8.7	—	1.29	—
50	45	70	10	10.2	—	2.6	—
50	100	130	15	18.4	—	49.4	—
50	100	150	15	18.1	—	283.4	—
50	150	200	15	39.9	—	296	—
50	200	250	30	52.4	—	789.8	—

NI: the number of instances; 𝑛: the number of nodes; 𝑚: the number of edges; 𝑟: the number of source-terminal pairs; VC: average approximation objective value by using Algorithm 16; VC1: average objective value by using implicit enumeration algorithm; TC: average running time in CPU-seconds by using Algorithm 16; TC1: average running time in CPU-seconds by using implicit enumeration algorithm.