Algorithms 2013, 6(1), 1-11; doi:10.3390/a6010001
Article

Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability

Received: 31 October 2012; in revised form: 13 December 2012 / Accepted: 18 December 2012 / Published: 27 December 2012
(This article belongs to the Special Issue Graph Algorithms)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph has been recently introduced in literature, motivated by applications in social network analysis. In this paper we investigate the approximation and parameterized complexity of the problem. First, we show that, for any constant ε > 0, the problem is not approximable within factor c1-ε, where c is the number of colors, and that the corresponding decision problem is W[1]-hard when parametrized by the number of disjoint paths. Then, we present a fixed-parameter algorithm for the problem parameterized by the number and the length of the disjoint paths.
Keywords: social networks; disjoint paths; fixed-parameter algorithms; hardness of approximation
PDF Full-text Download PDF Full-Text [189 KB, uploaded 27 December 2012 15:08 CET]

Export to BibTeX |
EndNote


MDPI and ACS Style

Bonizzoni, P.; Dondi, R.; Pirola, Y. Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability. Algorithms 2013, 6, 1-11.

AMA Style

Bonizzoni P, Dondi R, Pirola Y. Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability. Algorithms. 2013; 6(1):1-11.

Chicago/Turabian Style

Bonizzoni, Paola; Dondi, Riccardo; Pirola, Yuri. 2013. "Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability." Algorithms 6, no. 1: 1-11.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert