Degree-Constrained -Minimum Spanning Tree Problem

Table 6

Lower bounds obtained with and for Euclidean graphs using and .

#
			Opt		Time	#Cycles	#Iter	Opt		Time	#Cycles	#Iter
1	Berlin52	10	274.46	0	1.44	4	4	274.46	2	1.12	4	4
2		20	926.77	28584	50.95	81	80	926.77	42931	62.09	81	80
3		30	1935.71	432870	650.35	298	294	1935.71	384635	710.19	298	294
4		52	6081.63	1522843	4720.06	937	932	6076.57	1261869	3611.00	860	854
5	gr96	25	68.14	2782639	3619.00	169	92	68.07	2507913	3621.48	161	84
6		50	154.06	1878243	3716.32	196	65	153.89	1740625	3616.42	190	62
7		75	265.11	1188745	3614.37	297	152	264.86	1113079	3626.85	274	129
8		96	427.94	434160	3602.41	734	638	427.94	380249	3606.05	733	637
9	ch150	50	1545.75	1487346	3642.21	172	79	1545.23	1307916	3697.27	167	75
10		80	2599.80	1451730	3659.13	212	77	2598.40	1327931	3776.47	202	72
11		100	3388.09	859090	3682.26	226	108	3387.08	797571	3617.01	216	98
12		150	5882.45	133462	2909.89	499	419	5882.45	127032	2874.88	499	419
1	Berlin52	10	279.23	0	0.51	2	2	279.23	0	0.67	2	2
2		20	1015.39	64	2.47	15	5	1015.39	62	2.09	15	5
3		30	2065.12	134	2.23	15	4	2065.12	63	2.42	15	4
4		52	6968.77	0	0.73	10	3	6968.77	0	0.75	10	3
5	gr96	25	73.56	689177	1525.83	125	51	73.56	764555	1832.40	125	51
6		50	168.53	189277	981.32	109	36	168.53	303696	1584.56	109	36
7		75	283.14	24803	100.75	63	18	283.14	15880	96.28	63	18
8		96	474.95	11951	23.93	34	10	474.95	4802	17.58	34	10
9	ch150	50	1637.17	904211	3620.84	112	35	1636.05	989940	4001.45	106	31
10		80	2788.87	564918	3790.60	127	32	2786.68	539699	3697.03	123	30
11		100	3627.93	28619	279.88	66	14	3627.93	36800	341.06	66	14
12		150	6368.79	8152	43.71	38	10	6368.79	9046	45.69	38	10