A fixed-parameter tractability result for multicommodity demand flow in trees

We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed flows. This problem has been intensively studied for trees as well as for general graphs mainly from the viewpoint of polynomialtime approximation algorithms. By way of contrast, we provide an exact dynamic programming algorithm for this problem that works well whenever some natural problem parameter is small, a reasonable assumption in several applications. More specifically, we prove fixed-parameter tractability with respect to the maximum number of the input flows at any tree node. Keywords. Combinatorial problems, graph algorithms, NP-hard problems, exact algorithms, fixed-parameter tractability.

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Jiong Guo, Rolf Niedermeier
• Keywords: Algorithms, Exact Dynamic Programming, Fixed-parameter Tractability, IPL 2006