0
$\begingroup$

Given a undirected graph G=(V,E), each edge is associated with a non-negative value.

How to find the maximum number of vertex-disjoint paths from s to t on the graph G, with a constraint that the sum of paths length is not greater than a predefined value T.

  • 0
    Cross-posted to [Stackoverflow](http://stackoverflow.com/questions/11440353) and [thebirdietoldme.com](http://www.thebirdietoldme.com/userActions/thread/Question.aspx?id=11440353) (Please don't do this.)2012-12-04
  • 0
    Just wanted to clarify @DouglasS.Stones thebirdietoldme.com grabs all of the questions/answers in the stack exchange network into one site. It's currently offline, but just wanted to clarify this.2014-09-01

1 Answers 1