Abstract
We study the well-known Max Path Coloring problem from a parameterized point of view, focusing on trees and low-treewidth networks. We observe the existence of a variety of reasonable parameters for the problem, such as the maximum degree and treewidth of the network graph, the number of available colors and the number of requests one seeks to satisfy or reject. In an effort to understand the impact of each of these parameters on the problem’s complexity we study various parameterized versions of the problem deriving fixed-parameter tractability and hardness results both for undirected and bi-directed graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anand, R.S., Erlebach, T., Hall, A., Stefanakos, S.: Call control with k rejections. Journal of Computer and System Sciences 67(4), 707–722 (2003)
Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255–269 (2008)
Chen, J., Huang, X., Kanj, I.A., Xia, G.: Linear FPT reductions and computational lower bounds. In: Babai, L. (ed.) STOC, pp. 212–221. ACM (2004)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)
Erlebach, T., Jansen, K.: Maximizing the Number of Connections in Optical Tree Networks. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 179–188. Springer, Heidelberg (1998)
Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theoretical Computer Science 255(1-2), 33–50 (2001)
Erlebach, T., Jansen, K.: The maximum edge-disjoint paths problem in bidirected trees. SIAM Journal on Discrete Mathematics 14(3), 326–355 (2001)
Erlebach, T., Jansen, K., Kaklamanis, C., Mihail, M., Persiano, P.: Optimal wavelength routing on directed fiber trees. Theoretical Computer Science 221(1-2), 119–137 (1999)
Flum, J., Grohe, M.: Parameterized complexity theory. Springer-Verlag New York Inc. (2006)
Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods 1, 216 (1980)
Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997)
Golumbic, M.C., Jamison, R.E.: Edge and vertex intersection of paths in a tree. Discrete Mathematics 55(2), 151–159 (1985)
Impagliazzo, R., Paturi, R.: On the complexity of k-sat. J. Comput. Syst. Sci. 62(2), 367–375 (2001)
Kong, M.C., Zhao, Y.: On computing maximum k-independent sets. In: Congressus Numerantium, pp. 47–60 (1993)
Kumar, S.R., Panigrahy, R., Russell, A., Sundaram, R.: A note on optical routing on trees. Information Processing Letters 62(6), 295–300 (1997)
Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press, USA (2006)
Wan, P.J., Liu, L.: Maximal throughput in wavelength-routed optical networks. Multichannel Optical Networks: Theory and Practice 46, 15–26 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lampis, M. (2012). Parameterized Maximum Path Coloring. In: Marx, D., Rossmanith, P. (eds) Parameterized and Exact Computation. IPEC 2011. Lecture Notes in Computer Science, vol 7112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28050-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-28050-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28049-8
Online ISBN: 978-3-642-28050-4
eBook Packages: Computer ScienceComputer Science (R0)