The maximum integer multiterminal flow problem in directed graphs

0.00 Avg rating—0 Votes

Article ID:	iaor20081969
Country:	Netherlands
Volume:	35
Issue:	2
Start Page Number:	195
End Page Number:	200
Publication Date:	Mar 2007
Journal:	Operations Research Letters
Authors:	Bentz Cdric
Keywords:	networks: flow

Abstract:

Given an arc-capacitated digraph and k terminal vertices, the directed maximum integer multiterminal flow problem is to route the maximum number of flow units between the terminals. We introduce a new parameter kL≤k for this problem and study its complexity with respect to kL.

Reviews

Required fields are marked *. Your email address will not be published.