Degree-Constrained -Minimum Spanning Tree Problem

Table 5

Lower bounds obtained with and for random graphs using and .

#
			Opt		Time	#Cycles	#Iter	Opt		Time	#Cycles	#Iter
1	50	10	46.86	53	1.75	3	4	46.86	36	2.15	3	4
2		20	113.97	0	1.33	2	3	113.97	2	1.01	2	3
3		30	204.35	1021	5.62	14	14	204.35	755	5.63	14	14
4		50	459.09	955	6.40	23	22	459.09	611	5.99	23	22
5	100	25	115.44	53	4.01	2	3	115.44	22	2.90	2	3
6		50	263.95	3373	24.62	19	20	263.95	3394	26.10	19	20
7		75	454.44	7154	58.03	43	44	454.44	7558	59.75	43	44
8		100	749.75	214640	441.97	211	211	749.75	157118	446.80	211	211
9	200	50	162.55	8	23.45	4	5	162.55	15	23.78	4	5
10		100	378.24	1438706	3604.81	252	252	378.20	1241277	3624.11	237	237
11		150	651.49	1509749	3626.19	263	263	651.43	1214061	3614.95	239	239
12		200	1046.96	852808	3602.98	335	334	1046.95	1036504	3615.80	320	319
1	50	10	52.22	6	0.97	1	2	52.22	0	0.87	1	2
2		20	134.08	11	1.61	4	4	134.08	17	1.56	4	4
3		30	240.30	26	1.31	1	2	240.30	10	1.08	1	2
4		50	564.37	0	0.52	3	2	564.37	0	0.47	3	2
5	100	25	123.71	166	3.56	1	2	123.71	36	2.95	1	2
6		50	287.78	499	7.19	6	5	287.78	222	6.04	6	5
7		75	529.56	0	0.90	0	1	529.56	0	0.84	0	1
8		100	915.29	0	4.07	4	5	915.29	0	3.34	4	5
9	200	50	184.29	0	4.32	0	1	184.29	0	4.04	0	1
10		100	437.08	3274	31.73	4	4	437.08	1075	30.84	4	4
11		150	775.89	0	18.53	1	2	775.89	0	19.20	1	2
12		200	1285.32	0	7.05	1	2	1285.32	0	6.43	1	2