Code covered by the BSD License
 FindTree(G, vp)
G is matrix representing a undirected graph (V,E) have none negtive weighted edges, where the G(i,j) is the cost of edge(i,j)
 PCSTr(G, vp, r)
G is matrix representing a undirected graph (V,E) have none negtive weighted edges, where the G(i,j) is the cost of edge(i,j)

View all files
An Approximation Solution for the PrizeCollecting Steiner Tree Problem
by
Fangzhou Chen
18 Jan 2013
(Updated
21 Jan 2013)
A function giving feasible(not optimal) solutions to the PrizeCollecting Steiner Tree Problem


Contact us