Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Keyword(s):
LetG=(V,E)be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning treeTinGsuch that the total weight inTis at most a given boundB. In this paper, we present two polynomial time approximation schemes (PTASs) for the constrained minimum spanning tree problem.
2004 ◽
Vol 33
(2)
◽
pp. 261-268
◽
2014 ◽
Vol 19
(6)
◽
pp. 71-80
Keyword(s):
2014 ◽
pp. 713-724
◽
1998 ◽
pp. 682-694
◽