Code covered by the BSD License  

Highlights from
An Approximation Solution for the Prize-Collecting Steiner Tree Problem

  • 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 Prize-Collecting Steiner Tree Problem

by

 

18 Jan 2013 (Updated )

A function giving feasible(not optimal) solutions to the Prize-Collecting Steiner Tree Problem

All files for An Approximation Solution for the Prize-Collecting Steiner Tree Problem

Contact us