View License

Download apps, toolboxes, and other File Exchange content using Add-On Explorer in MATLAB.

» Watch video

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

Join the 15-year community celebration.

Play games and win prizes!

» Learn more

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

Prize_Collecting_Steiner_Tree.zip
FindTree.m
license.txt
PCSTr.m

Contact us